Sciweavers

2514 search results - page 429 / 503
» On the Computation of Approximations of Database Queries
Sort
View
137
Voted
TASLP
2008
176views more  TASLP 2008»
15 years 15 days ago
Analysis of Minimum Distances in High-Dimensional Musical Spaces
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
Michael Casey, Christophe Rhodes, Malcolm Slaney
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...
83
Voted
SIGCOMM
2009
ACM
15 years 7 months ago
SMS-based contextual web search
SMS-based web search is different from traditional web search in that the final response to a search query is limited to a very small number of bytes (typically 1-2 SMS messages...
Jay Chen, Brendan Linn, Lakshminarayanan Subramani...
101
Voted
SP
2007
IEEE
102views Security Privacy» more  SP 2007»
15 years 6 months ago
Improving the Robustness of Private Information Retrieval
Since 1995, much work has been done creating protocols for private information retrieval (PIR). Many variants of the basic PIR model have been proposed, including such modificati...
Ian Goldberg
CF
2007
ACM
15 years 4 months ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...