Sciweavers

144 search results - page 27 / 29
» Query dependent ranking using K-nearest neighbor
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 2 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
SPIRE
2004
Springer
14 years 27 days ago
Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...
Vishwa Vinay, Ingemar J. Cox, Natasa Milic-Fraylin...
SENSYS
2003
ACM
14 years 24 days ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
James Newsome, Dawn Xiaodong Song
ADBIS
2008
Springer
219views Database» more  ADBIS 2008»
14 years 1 months ago
Data Stream Analysis for Location-Aware Collaborative Information Retrieval
Abstract. We propose a new approach for enhancing collaborative information retrieval by means of incorporating positional data for a location-aware personalized retrieval process....
Andreas Behrend, Frank Reichartz, Christian Dorau,...