Sciweavers

2887 search results - page 460 / 578
» Name Generation and Linearity
Sort
View
ICLP
2005
Springer
15 years 11 months ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
IEAAIE
2005
Springer
15 years 11 months ago
Movement Prediction from Real-World Images Using a Liquid State Machine
Prediction is an important task in robot motor control where it is used to gain feedback for a controller. With such a self-generated feedback, which is available before sensor rea...
Harald Burgsteiner, Mark Kröll, Alexander Leo...
INDOCRYPT
2005
Springer
15 years 11 months ago
Attack the Dragon
1 Dragon is a word oriented stream cipher submitted to the ECRYPT project, it operates on key sizes of 128 and 256 bits. The original idea of the design is to use a nonlinear feedb...
Håkan Englund, Alexander Maximov
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 11 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
LACL
2005
Springer
15 years 11 months ago
Strict Deterministic Aspects of Minimalist Grammars
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
John T. Hale, Edward P. Stabler