Sciweavers

129
Voted
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 7 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
123
Voted
CP
2000
Springer
15 years 7 months ago
Algebraic Simplification Techniques for Propositional Satisfiability
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instan...
João P. Marques Silva
140
Voted
CP
2000
Springer
15 years 7 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
149
Voted
CVPR
1998
IEEE
15 years 7 months ago
Appearance Based Behavior Recognition by Event Driven Selective Attention
Most of behavior recognition methods proposed so far share the limitations of bottom-up analysis, and singleobject assumption; the bottom-up analysis can be confused by erroneous ...
Toshikazu Wada, Takashi Matsuyama