727 search results - page 85 / 146 » Private approximation of search problems |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
ATAL
2007
Springer
14 years 4 months ago
2007
Springer
Distributed message relaying is an important function of a peer-topeer system to discover service providers. Existing search protocols in unstructured peer-to-peer systems either ...
CPAIOR
2008
Springer
13 years 11 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
ICDE
1999
IEEE
14 years 11 months ago
1999
IEEE
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...