2004 search results - page 371 / 401 » Sampling from large graphs |
111
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
127
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
Our goal is to segment a video sequence into moving objects and the world scene. In recent work, spectral embedding of point trajectories based on 2D motion cues accumulated from ...
102
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
Boosting has been widely applied in computer vision, especially after Viola and Jones's seminal work [23]. The marriage of rectangular features and integral-imageenabled fast...
114
click to vote
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
71
Voted
RECOMB
2006
Springer
16 years 2 days ago
2006
Springer
Advances in tandem mass-spectrometry (MS/MS) steadily increase the rate of generation of MS/MS spectra and make it more computationally challenging to analyze such huge datasets. A...