183 search results - page 32 / 37 » On the Matching Problem for Special Graph Classes |
111
click to vote
FCT
2005
Springer
15 years 3 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
163
Voted
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
93
Voted
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
JAT
2010
14 years 8 months ago
2010
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...