Sciweavers

3415 search results - page 451 / 683
» Lower bounds on kernelization
Sort
View
ECCV
2008
Springer
16 years 8 months ago
Image Segmentation by Branch-and-Mincut
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
Victor S. Lempitsky, Andrew Blake, Carsten Rother
ICIP
2003
IEEE
16 years 8 months ago
A new rate-minimizing matching criterion and a fast algorithm for block motion estimation
We present a new block matching criterion for motion estimation in video coding that will give better encoded video quality than the commonly used sum of absolute differences (SAD...
Tuukka Toivonen, Janne Heikkilä
ICIP
1994
IEEE
16 years 8 months ago
Document Image Decoding
It has been shown that the computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. In ...
Gary E. Kopec, Philip A. Chou
ICDE
2006
IEEE
162views Database» more  ICDE 2006»
16 years 8 months ago
Efficient Batch Top-k Search for Dictionary-based Entity Recognition
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
Amit Chandel, P. C. Nagesh, Sunita Sarawagi
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
16 years 7 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu