Sciweavers

298 search results - page 9 / 60
» ideal 2010
Sort
View
ICASSP
2010
IEEE
14 years 9 months ago
An L1 criterion for dictionary learning by subspace identification
We propose an ℓ1 criterion for dictionary learning for sparse signal representation. Instead of directly searching for the dictionary vectors, our dictionary learning approach i...
Florent Jaillet, Rémi Gribonval, Mark D. Pl...
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
15 years 7 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
DSS
2007
76views more  DSS 2007»
14 years 9 months ago
Deadline-based escalation in process-aware information systems
Process-aware information systems are typically driven by process models capturing an idealized view of the actual processes. For example, most process models assume that planned ...
Wil M. P. van der Aalst, Michael Rosemann, Marlon ...
CSL
2010
Springer
14 years 9 months ago
A computational auditory scene analysis system for speech segregation and robust speech recognition
A conventional automatic speech recognizer does not perform well in the presence of multiple sound sources, while human listeners are able to segregate and recognize a signal of i...
Yang Shao, Soundararajan Srinivasan, Zhaozhang Jin...
ML
2010
ACM
163views Machine Learning» more  ML 2010»
14 years 4 months ago
Classification with guaranteed probability of error
We introduce a general-purpose learning machine that we call the Guaranteed Error Machine, or GEM, and two learning algorithms, a real GEM algorithm and an ideal GEM algorithm. Th...
Marco C. Campi