Sciweavers

17049 search results - page 116 / 3410
» cans 2007
Sort
View
IJCNN
2007
IEEE
14 years 3 months ago
Sparse Distributed Representations for Words with Thresholded Independent Component Analysis
— We show that independent component analysis (ICA) can be used to find distributed representations for words that can be further processed by thresholding to produce sparse rep...
Jaakko J. Väyrynen, Lasse Lindqvist, Timo Hon...
ISCAS
2007
IEEE
144views Hardware» more  ISCAS 2007»
14 years 3 months ago
A Fully Programmable Analog Window Comparator
— This paper presents a novel design of analog window comparator circuit. The comparator can adaptively adjust its error threshold according to the magnitude of input signal leve...
Rui Xiao, Amit Laknaur, Haibo Wang
FCT
2007
Springer
14 years 3 months ago
Complexity of Pebble Tree-Walking Automata
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
Mathias Samuelides, Luc Segoufin
SAGA
2007
Springer
14 years 3 months ago
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata
A two-way finite automaton is sweeping if its input head can change direction only on the end-markers. For each n ≥ 2, we exhibit a problem that can be solved by a O(n2 )-state ...
Christos A. Kapoutsis, Richard Královic, To...
TAMC
2007
Springer
14 years 3 months ago
Working with the LR Degrees
We say that A ≤LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on ...
George Barmpalias, Andrew E. M. Lewis, Mariya Ivan...