| Login | Create Account |
Items where Project is "Miscellaneous" and Year is 2005
Jump to: Estimating Data Stream Quality for Object-Detection Applications | Event Dissemination in High-Mobility Ad-hoc Networks | Generic Entity Resolution with Data Confidences | Link Spam Alliances | Link Spam Detection Based on Mass Estimation | On the Worst Case Complexity of the k-means Method | Representing Uncertain Data: Uniqueness, Equivalence, Minimization, and Approximation | Scheduling And Resource Allocation In Autonomous Service Networks | Swoosh: A Generic Approach to Entity Resolution | Truthful Auctions for Pricing Search Keywords | ULDBs: Databases with Uncertainty and Lineage | Web Spam Taxonomy | Working Models for Uncertain Data Number of items: 14.
Estimating Data Stream Quality for Object-Detection ApplicationsDas Sarma, Anish and R. Jeffery, Shawn and J. Franklin, Michael and Widom, Jennifer (2005) Estimating Data Stream Quality for Object-Detection Applications. Technical Report. Stanford. Event Dissemination in High-Mobility Ad-hoc NetworksKan, Masataka and Pande, Rahul and Vinograd, Patrick and Garcia-Molina, Hector (2005) Event Dissemination in High-Mobility Ad-hoc Networks. Technical Report. Stanford. Generic Entity Resolution with Data ConfidencesMenestrina, David and Benjelloun, Omar and Garcia-Molina, Hector (2005) Generic Entity Resolution with Data Confidences. Technical Report. Stanford. Link Spam AlliancesGyongyi, Zoltan and Garcia-Molina, Hector (2005) Link Spam Alliances. Technical Report. Stanford. Gyongyi, Zoltan and Garcia-Molina, Hector (2005) Link Spam Alliances. In: 31st International Conference on Very Large Data Bases (VLDB 2005), August 30 to September 2, 2005, Trondheim, Norway. Link Spam Detection Based on Mass EstimationGyongyi, Zoltan and Berkhin, Pavel and Garcia-Molina, Hector and Pedersen, Jan (2005) Link Spam Detection Based on Mass Estimation. Technical Report. Stanford. On the Worst Case Complexity of the k-means MethodArthur, David and Vassilvitskii, Sergei (2005) On the Worst Case Complexity of the k-means Method. Technical Report. Stanford. Representing Uncertain Data: Uniqueness, Equivalence, Minimization, and ApproximationDas Sarma, Anish and U. Nabar, Shubha and Widom, Jennifer (2005) Representing Uncertain Data: Uniqueness, Equivalence, Minimization, and Approximation. Technical Report. Stanford. Scheduling And Resource Allocation In Autonomous Service NetworksSample, Neal (2005) Scheduling And Resource Allocation In Autonomous Service Networks. PhD thesis, Stanford University. Swoosh: A Generic Approach to Entity ResolutionBenjelloun, Omar and Garcia-Molina, Hector and Menestrina, David and Su, Qi and Whang, Steven Euijong and Widom, Jennifer (2005) Swoosh: A Generic Approach to Entity Resolution. Technical Report. Stanford. Truthful Auctions for Pricing Search KeywordsAggarwal, Gagan and Goel, Ashish and Motwani, Rajeev (2005) Truthful Auctions for Pricing Search Keywords. Technical Report. Stanford. ULDBs: Databases with Uncertainty and LineageBenjelloun, Omar and Das Sarma, Anish and Halevy, Alon and Widom, Jennifer (2005) ULDBs: Databases with Uncertainty and Lineage. Technical Report. Stanford. Web Spam TaxonomyGyongyi, Zoltan and Garcia-Molina, Hector (2005) Web Spam Taxonomy. In: First International Workshop on Adversarial Information Retrieval on the Web (AIRWeb 2005), May 10-14, 2005, Chiba, Japan. Working Models for Uncertain DataDas Sarma, Anish and Benjelloun, Omar and Halevy, Alon and Widom, Jennifer (2005) Working Models for Uncertain Data. Technical Report. Stanford. |
