2095 search results - page 138 / 419 » Improved pebbling bounds |
212
Voted
VTS
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper presents an improved method to accurately estimate signal probabilities using ordered partial decision diagrams (OPDDs) [Kodavarti 93] for partial representation of the...
190
Voted
CP
2005
Springer
16 years 1 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
191
click to vote
WAOA
2004
Springer
16 years 24 days ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
158
Voted
FOCS
2003
IEEE
16 years 23 days ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
159
Voted
ICDAR
2003
IEEE
16 years 22 days ago
2003
IEEE
Image warping is a common problem when one scans or photocopies a document page from a thick bound volume, resulting in shading and curved text lines in the spine area of the boun...