248 search results - page 32 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
164
click to vote
ICIP
2000
IEEE
16 years 4 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
129
click to vote
GPEM
2008
15 years 3 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
111
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
123
click to vote
NIPS
2008
15 years 4 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
129
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...