301 search results - page 31 / 61 » Efficient Sketches for the Set Query Problem |
143
click to vote
SSD
2007
Springer
15 years 5 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
79
Voted
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
In today's Internet applications or sensor networks we often encounter large amounts of data spread over many physically distributed nodes. The sheer volume of the data and ba...
CIKM
2003
Springer
15 years 4 months ago
2003
Springer
The research proposed here concentrates on the problem of designing and developing a spoken query retrieval (SQR) system to access large document databases via voice. The main cha...
175
click to vote
SIGMOD
2006
ACM
15 years 11 months ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
109
click to vote
SIBGRAPI
2008
IEEE
15 years 5 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...