388 search results - page 56 / 78 » An approximate algorithm for median graph computation using ... |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
COCO
1994
Springer
13 years 12 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
EMMCVPR
2001
Springer
14 years 9 days 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...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
IEEEMSP
2002
IEEE
14 years 22 days ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...