Sciweavers

151 search results - page 13 / 31
» A CSP Search Algorithm with Reduced Branching Factor
Sort
View
ICDE
2006
IEEE
162views Database» more  ICDE 2006»
14 years 9 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
CP
2005
Springer
14 years 1 months ago
Mind the Gaps: A New Splitting Strategy for Consistency Techniques
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
Heikel Batnini, Claude Michel, Michel Rueher
CP
2006
Springer
13 years 11 months ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed
JVCIR
2006
98views more  JVCIR 2006»
13 years 7 months ago
Fast motion search with efficient inter-prediction mode decision for H.264
A fast inter-prediction mode decision and motion search algorithm is proposed for the H.264 video coding standard. The multi-resolution motion estimation scheme and an adaptive ra...
Chih-Hung Kuo, Mei-Yin Shen, C. C. Jay Kuo
BMCBI
2008
133views more  BMCBI 2008»
13 years 7 months ago
CORE_TF: a user-friendly interface to identify evolutionary conserved transcription factor binding sites in sets of co-regulated
Background: The identification of transcription factor binding sites is difficult since they are only a small number of nucleotides in size, resulting in large numbers of false po...
Matthew S. Hestand, Michiel van Galen, Michel P. V...