2219 search results - page 250 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
161
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
145
Voted
EXPCS
2007
15 years 5 months ago
2007
Pipeline Spectroscopy is a new technique that allows us to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogram, which represents a precis...
120
Voted
SIGCSE
2009
ACM
16 years 4 months ago
2009
ACM
Like a screenplay, a program is both a static artifact and instructions for a dynamic performance. This duality can keep laypeople from appreciating the complexity of software sys...
112
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
We present an algorithm for detecting multiple rotational symmetries in natural images. Given an image, its gradient magnitude field is computed, and information from the gradient...
117
Voted
CVPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...