12863 search results - page 2272 / 2573 » Dynamic Data Mining |
140
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
185
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
In this paper, we present a stochastic algorithm by effective Markov chain Monte Carlo (MCMC) for segmenting and reconstructing 3D scenes. The objective is to segment a range image...
138
click to vote
PPOPP
2009
ACM
16 years 5 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
126
click to vote
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...
145
Voted
PODS
2004
ACM
16 years 4 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...