231 search results - page 16 / 47 » Sublinear time approximate clustering |
CCCG
2008
13 years 9 months ago
2008
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Time series motifs are approximately repeated patterns found within the data. Such motifs have utility for many data mining algorithms, including rule-discovery, novelty-detection...
SIGMOD
2010
ACM
14 years 9 days ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...