628 search results - page 96 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
122
Voted
ACMSE
2009
ACM
15 years 9 months ago
2009
ACM
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...
115
Voted
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
We propose an approach to speeding up object detection, with an emphasis on settings where multiple object classes are being detected. Our method uses a segmentation algorithm to ...
116
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
155
Voted
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
120
Voted
IPCO
2010
15 years 4 months ago
2010
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...