501 search results - page 23 / 101 » Rough Sets and Approximation Schemes |
CGF
2008
13 years 10 months ago
2008
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
KDD
2008
ACM
14 years 10 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
IWSOS
2011
Springer
13 years 23 days ago
2011
Springer
Abstract This paper depicts and evaluates an evolutionary design process for generating a complex self-organizing multicellular system based on Cellular Automata (CA). We extend th...
COMPGEOM
2011
ACM
13 years 1 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...