756 search results - page 101 / 152 » Structure or Noise |
165
Voted
SIGMOD
2008
ACM
16 years 29 days ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
114
click to vote
IROS
2007
IEEE
15 years 7 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
121
Voted
WPES
2003
ACM
15 years 6 months ago
2003
ACM
Privacy is becoming an increasingly important issue in many data mining applications, particularly in the security and defense area. This has triggered the development of many pri...
134
click to vote
ICCV
1999
IEEE
15 years 5 months ago
1999
IEEE
We describe an effective and novel approach to infer sign and direction of principal curvatures at each input site from noisy 3D data. Unlike most previous approaches, no local su...
103
Voted
STOC
1997
ACM
15 years 5 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...