254 search results - page 12 / 51 » Binary amiable Words |
101
Voted
TOIS
2002
15 years 10 days ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
101
click to vote
DAM
2008
15 years 24 days ago
2008
We prove that binary decision diagrams [1] can be polynomially simulated by the extended resolution rule of [2]. More precisely, for any unsatisfiable formula , there exists an ex...
106
Voted
ESANN
2008
15 years 2 months ago
2008
Abstract. An architecture for achieving word recognition and incremental learning of new words in a language processing system is presented. The architecture is based on neural ass...
107
Voted
COLING
1992
15 years 1 months ago
1992
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
109
Voted
DM
2008
15 years 24 days ago
2008
We first give a bijective proof of Gould's identity in the model of binary words. Then we deduce Rothe's identity from Gould's identity again by a bijection, which a...