Sciweavers

2657 search results - page 221 / 532
» On the complexity of hierarchical problem solving
Sort
View
CORR
2004
Springer
94views Education» more  CORR 2004»
15 years 1 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
IJNS
2000
80views more  IJNS 2000»
15 years 1 months ago
VLSI Implementation of Neural Networks
Currently, fuzzy controllers are the most popular choice for hardware implementation of complex control surfaces because they are easy to design. Neural controllers are more compl...
Bogdan M. Wilamowski, J. Binfet, M. O. Kaynak
ICASSP
2011
IEEE
14 years 5 months ago
On the instantaneous frequency smoothing for signals with quasi-linear frequency changes
The problem of estimation of the slowly-varying instantaneous frequency of a nonstationary complex sinusoidal signal buried in noise is considered. This problem is usually solved ...
Maciej Niedzwiecki, Michal Stanislaw Meller
ICRA
2008
IEEE
181views Robotics» more  ICRA 2008»
15 years 8 months ago
Kinematics of the wire-driven parallel robot MARIONET using linear actuators
— Wire-driven parallel robots are special types of Gough-Stewart platform in which the rigid extensible legs are substituted by extensible wires. Usually wire length change is ob...
Jean-Pierre Merlet
POPL
2009
ACM
16 years 2 months ago
Modular code generation from synchronous block diagrams: modularity vs. code size
We study modular, automatic code generation from hierarchical block diagrams with synchronous semantics. Such diagrams are the fundamental model behind widespread tools in the emb...
Roberto Lublinerman, Christian Szegedy, Stavros Tr...