1424 search results - page 170 / 285 » The Multi-radius Cover Problem |
131
click to vote
DAGM
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present a novel statistical-model-based segmentation algorithm that addresses a recurrent problem in appearance model fitting and model-based segmentation: the "s...
136
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
121
click to vote
IJBRA
2008
15 years 3 months ago
2008
Abstract Observing behaviors of protein pathways and genetic networks under various environments in living cells is essential for unraveling disease and developing drugs. For that ...
138
click to vote
CONSTRAINTS
2007
15 years 3 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
111
click to vote
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--In this paper, we consider a novel problem referred to as term filtering with bounded error to reduce the term (feature) space by eliminating terms without (or with bound...