Sciweavers

328 search results - page 35 / 66
» Deterministic k-set structure
Sort
View
LFCS
2009
Springer
13 years 12 months ago
A Bialgebraic Approach to Automata and Formal Language Theory
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...
James Worthington
ICCAD
1997
IEEE
147views Hardware» more  ICCAD 1997»
13 years 11 months ago
Built-in test generation for synchronous sequential circuits
We consider the problem of built-in test generation for synchronous sequential circuits. The proposed scheme leaves the circuit flip-flops unmodified, and thus allows at-speed ...
Irith Pomeranz, Sudhakar M. Reddy
SSPR
2000
Springer
13 years 11 months ago
Encoding Nondeterministic Finite-State Tree Automata in Sigmoid Recursive Neural Networks
Abstract. Recently, a number of authors have explored the use of recursive recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most...
Mikel L. Forcada, Rafael C. Carrasco
EMNLP
2007
13 years 8 months ago
Japanese Dependency Analysis Using the Ancestor-Descendant Relation
We propose a novel method for Japanese dependency analysis, which is usually reduced to the construction of a dependency tree. In deterministic approaches to this task, dependency...
Akihiro Tamura, Hiroya Takamura, Manabu Okumura
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
13 years 8 months ago
Dynamic optimality for skip lists and B-trees
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...