Sciweavers

1151 search results - page 159 / 231
» Modelling Digital Circuits Problems with Set Constraints
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
IPSN
2009
Springer
15 years 4 months ago
Simultaneous placement and scheduling of sensors
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlo...
AUTOMATICA
2006
113views more  AUTOMATICA 2006»
14 years 10 months ago
Least costly identification experiment for control
All approaches to optimal experiment design for control have so far focused on deriving an input signal (or input signal spectrum) that minimizes some control-oriented measure of ...
Xavier Bombois, Gérard Scorletti, Michel Ge...
CVPR
2009
IEEE
16 years 4 months ago
Geometric Reasoning for Single Image Structure Recovery
We study the problem of generating plausible interpretations of a scene from a collection of line segments automatically extracted from a single indoor image. We show that we ca...
David C. Lee, Martial Hebert, Takeo Kanade
CDC
2009
IEEE
121views Control Systems» more  CDC 2009»
15 years 2 months ago
Piecewise-linear constrained control for timed continuous Petri nets
— Timed Continuous Petri Net (TCPN) systems are piecewise linear models with input constraints that can approximate the dynamical behavior of a class of timed discrete event syst...
Carlos Renato Vázquez, Manuel Silva