5595 search results - page 999 / 1119 » Approximation Algorithms for Clustering Problems |
197
click to vote
FGR
2011
IEEE
14 years 8 months ago
2011
IEEE
—An expression can be approximated by a sequence of temporal segments called neutral, onset, offset and apex. However, it is not easy to accurately detect such temporal segments ...
161
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
166
click to vote
ECCV
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. We cast the problem of motion segmentation of feature trajectories as linear manifold finding problems and propose a general framework for motion segmentation under affin...
173
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
149
click to vote
TC
2008
15 years 4 months ago
2008
Cryptanalysis of ciphers usually involves massive computations. The security parameters of cryptographic algorithms are commonly chosen so that attacks are infeasible with availabl...