6740 search results - page 1148 / 1348 » An s -Hamiltonian Line Graph Problem |
170
click to vote
IEEEMSP
2002
IEEE
15 years 9 months 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...
161
click to vote
KR
2010
Springer
15 years 9 months ago
2010
Springer
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
115
click to vote
GD
2009
Springer
15 years 9 months ago
2009
Springer
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
147
click to vote
EMMCVPR
2001
Springer
15 years 9 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...
153
click to vote
DATE
2000
IEEE
15 years 9 months ago
2000
IEEE
There has been a proliferation of block-diagram environments for specifying and prototyping DSP systems. These include tools from academia like Ptolemy [3], and GRAPE [7], and com...