Sciweavers

99 search results - page 2 / 20
» Efficiently evaluating complex boolean expressions
Sort
View
JSAT
2006
108views more  JSAT 2006»
13 years 4 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
14 years 5 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
INTEGRATION
2008
89views more  INTEGRATION 2008»
13 years 4 months ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
ICALP
2009
Springer
14 years 5 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ISVC
2007
Springer
13 years 11 months ago
Feature-Adaptive Motion Energy Analysis for Facial Expression Recognition
In this paper, we present a facial expression recognition method using feature-adaptive motion energy analysis. Our method is simplicityoriented and avoids complicated face model r...
Sungkyu Noh, Hanhoon Park, Yoonjong Jin, Jong-Il P...