16404 search results - page 310 / 3281 » A set coverage problem |
156
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. We introduce a shape detection framework called Contour Context Selection for detecting objects in cluttered images using only one exemplar. Shape based detection is inva...
139
click to vote
VISUALIZATION
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is cons...
169
click to vote
PE
2010
Springer
14 years 11 months ago
2010
Springer
Accurately characterizing the resource usage of an application at various levels in the memory hierarchy has been a long-standing research problem. Existing characterization studi...
150
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
142
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...