17390 search results - page 3354 / 3478 » Distributed Data Clustering |
159
click to vote
SIGIR
2012
ACM
13 years 4 months ago
2012
ACM
The detection and improvement of low-quality information is a key concern in Web applications that are based on user-generated content; a popular example is the online encyclopedi...
144
click to vote
ICDT
2012
ACM
13 years 4 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
137
click to vote
SDM
2012
SIAM
13 years 4 months ago
2012
SIAM
: Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
111
click to vote
SPAA
2009
ACM
16 years 2 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
150
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...