2944 search results - page 219 / 589 » Improving Bound Propagation |
156
click to vote
CP
2005
Springer
16 years 3 days 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...
160
click to vote
WAOA
2004
Springer
15 years 12 months 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...
131
click to vote
FOCS
2003
IEEE
15 years 12 months 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 (Ç´...
139
click to vote
ICDAR
2003
IEEE
15 years 12 months 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...
146
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...