1105 search results - page 91 / 221 » Approximate Spectral Clustering. |
122
Voted
DASFAA
2003
IEEE
15 years 6 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
95
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
105
click to vote
KAIS
2006
15 years 20 days ago
2006
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
136
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
115
click to vote
ICIP
2008
IEEE
15 years 7 months ago
2008
IEEE
The wavelet transform hierarchically decomposes images with prescribed bases, while multilineal models search for optimal bases to adapt visual data. In this paper, we integrate t...