Sciweavers

696 search results - page 12 / 140
» A class of combinatorial identities
Sort
View
ACL
1996
15 years 1 months ago
Efficient Normal-Form Parsing for Combinatory Categorial Grammar
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures...
Jason Eisner
TIT
2008
107views more  TIT 2008»
14 years 11 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
COMBINATORICS
2004
93views more  COMBINATORICS 2004»
14 years 11 months ago
On the Combinatorial Structure of Arrangements of Oriented Pseudocircles
We introduce intersection schemes (a generalization of uniform oriented matroids of rank 3) to describe the combinatorial properties of arrangements of pseudocircles in the plane ...
Johann Linhart, Ronald Ortner
ICCAD
2007
IEEE
115views Hardware» more  ICCAD 2007»
15 years 8 months ago
Timing optimization by restructuring long combinatorial paths
—We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We ...
Jürgen Werber, Dieter Rautenbach, Christian S...
INFFUS
2000
122views more  INFFUS 2000»
14 years 11 months ago
Multi-modal identity verification using expert fusion
The contribution of this paper is to compare paradigms coming from the classes of parametric, and non-parametric techniques to solve the decision fusion problem encountered in the...
Patrick Verlinde, Gérard Chollet, Marc Ache...