Sciweavers

144 search results - page 16 / 29
» Approximate Reasoning in MAS: Rough Set Approach
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 1 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
ICTAI
2003
IEEE
15 years 3 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
CG
2005
Springer
14 years 9 months ago
Combining SP-Octrees and impostors for the visualisation of multiresolution models
Space-Partition Octree (SP-Octree) is a hierarchical representation scheme for solid modelling. It allows a multiresolution representation of polyhedral objects, and has been succ...
Francisco J. Melero, Pedro Cano, Juan Carlos Torre...
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
15 years 11 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
14 years 11 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount