Sciweavers

3082 search results - page 198 / 617
» New Bounds for the Controller Problem
Sort
View
CP
2005
Springer
15 years 10 months ago
Tree Decomposition with Function Filtering
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...
Martí Sánchez, Javier Larrosa, Pedro...
ICDAR
2003
IEEE
15 years 10 months ago
Correcting Document Image Warping Based on Regression of Curved Text Lines
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...
Zheng Zhang 0003, Chew Lim Tan
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
16 years 5 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
VTC
2008
IEEE
218views Communications» more  VTC 2008»
15 years 11 months ago
Performance Analysis of a System using Coordinate Interleaving and Constellation Rotation in Rayleigh Fading Channels
Abstract— Diversity can play an important role in the performance improvement of a communication system in fading channels. The achievable performance with signal space diversity...
Nauman F. Kiyani, Jos H. Weber, Alenka G. Zajic, G...
SOFSEM
2007
Springer
15 years 10 months ago
Exact Max 2-Sat: Easier and Faster
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
Martin Fürer, Shiva Prasad Kasiviswanathan