Sciweavers

728 search results - page 63 / 146
» New Directions in Question Answering
Sort
View
ICPR
2008
IEEE
16 years 2 months ago
An evaluation survey of binarization algorithms on historical documents
Document binarization is an active research area for many years. There are many difficulties associated with satisfactory binarization of document images and especially in cases o...
Pavlos Stathis, Ergina Kavallieratou, Nikos Papama...
VLSID
2004
IEEE
108views VLSI» more  VLSID 2004»
16 years 1 months ago
Boolean Decomposition Using Two-literal Divisors
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
Nilesh Modi, Jordi Cortadella
STACS
2009
Springer
15 years 8 months ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx
LICS
2009
IEEE
15 years 8 months ago
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
Oliver Friedmann
GLOBECOM
2007
IEEE
15 years 7 months ago
Maximum Likelihood Detection and Optimal Code Design for Differential Unitary Space-Time Modulation with Carrier Frequency Offse
Abstract— In this paper, we answer the question that “Can conventional differential unitary space time modulation (DUSTM) be applied when there is an unknown carrier frequency ...
Tao Cui, Feifei Gao, Arumugam Nallanathan, Chintha...