254 search results - page 12 / 51 » Binary amiable Words |
91
Voted
TOIS
2002
14 years 10 months 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...
84
Voted
DAM
2008
14 years 11 months 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...
92
Voted
ESANN
2008
15 years 11 days 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...
COLING
1992
15 years 3 days 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...
DM
2008
14 years 11 months 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...