Sciweavers

9888 search results - page 1906 / 1978
» compute 2009
Sort
View
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
15 years 7 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
WSDM
2009
ACM
198views Data Mining» more  WSDM 2009»
15 years 7 months ago
Measuring the similarity between implicit semantic relations using web search engines
Measuring the similarity between implicit semantic relations is an important task in information retrieval and natural language processing. For example, consider the situation whe...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
15 years 7 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
WSDM
2009
ACM
115views Data Mining» more  WSDM 2009»
15 years 7 months ago
Discovering and using groups to improve personalized search
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
Jaime Teevan, Meredith Ringel Morris, Steve Bush
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 7 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
« Prev « First page 1906 / 1978 Last » Next »