Sciweavers

36 search results - page 5 / 8
» Worst-Case Analysis of the Perceptron and Exponentiated Upda...
Sort
View
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 9 days ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
COMPGEOM
2010
ACM
13 years 12 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
13 years 12 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
TIT
2010
137views Education» more  TIT 2010»
13 years 2 months ago
Average case analysis of multichannel sparse recovery using convex relaxation
This paper considers recovery of jointly sparse multichannel signals from incomplete measurements. Several approaches have been developed to recover the unknown sparse vectors from...
Yonina C. Eldar, Holger Rauhut