1933 search results - page 95 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
163
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
148
click to vote
PAMI
2007
15 years 3 months ago
2007
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
137
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
This paper presents a robust algorithm to deblur two consecutively captured blurred photos from camera shaking. Previous dual motion deblurring algorithms succeeded in small and s...
147
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
142
Voted
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...