118 search results - page 17 / 24 » Fast Algorithms for Constant Approximation k-Means Clusterin... |
102
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
AMR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. This article explores the feasibility of a market-ready, mobile pattern recognition system based on the latest findings in the field of object recognition and currently a...
84
Voted
VLDB
2001
ACM
15 years 4 months ago
2001
ACM
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
CGF
2008
14 years 11 months ago
2008
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
TCS
2010
14 years 10 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...