520 search results - page 37 / 104 » Reductions Between Expansion Problems |
130
click to vote
CONCUR
2008
Springer
15 years 4 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
172
click to vote
EOR
2006
15 years 2 months ago
2006
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
129
click to vote
ICPR
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper we introduce a novel graphical image representation comprising a single curve—the one-liner. The first step involves the detection and linking of image edges. We ...
114
click to vote
NIPS
2008
15 years 3 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...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....