Sciweavers

3116 search results - page 72 / 624
» Recovering
Sort
View
120
Voted
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 8 months ago
On Pseudoentropy versus Compressibility
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...
Hoeteck Wee
110
Voted
FLOPS
2004
Springer
15 years 8 months ago
Relaxing the Value Restriction
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advant...
Jacques Garrigue
114
Voted
HYBRID
2004
Springer
15 years 8 months ago
Observability of Switched Linear Systems
The observability of deterministic, discrete-time, switched, linear systems is considered. Depending on whether or not the modes are observed, and on whether the continuous state o...
Mohamed Babaali, Magnus Egerstedt
98
Voted
ICA
2004
Springer
15 years 8 months ago
On the Strong Uniqueness of Highly Sparse Representations from Redundant Dictionaries
A series of recent results shows that if a signal admits a sufficiently sparse representation (in terms of the number of nonzero coefficients) in an “incoherent” dictionary, th...
Rémi Gribonval, Morten Nielsen
IPTPS
2004
Springer
15 years 8 months ago
Willow: DHT, Aggregation, and Publish/Subscribe in One Protocol
—This paper describes a new peer-to-peer protocol that integrates DHT routing, aggregation, allto-all multicast, as well as both topic- and content-based publish/subscribe. In sp...
Robbert van Renesse, Adrian Bozdog