3201 search results - page 105 / 641 » High Quality Hatching |
187
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
142
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
We present a technique that masks failures in a cluster to provide high availability and fault-tolerance for long-running, parallelized dataflows. We can use these dataflows to im...
157
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
123
click to vote
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
— There is an ever increasing need for storing data in smaller and smaller form factors driven by the ubiquitous use and increased demands of consumer electronics. A new approach...
250
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Abstract-- Many applications are driven by evolving data -patterns in web traffic, program execution traces, network event logs, etc., are often non-stationary. Building prediction...