Sciweavers

3972 search results - page 638 / 795
» Cosparse analysis modeling - uniqueness and algorithms
Sort
View
IPL
2010
112views more  IPL 2010»
15 years 2 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
JMLR
2010
195views more  JMLR 2010»
15 years 2 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
JSAC
2010
143views more  JSAC 2010»
15 years 2 months ago
Balancing competing resource allocation demands in a public cellular network that supports emergency services
Abstract—When an emergency happens, public communication networks, including cellular networks, public switched telecommunication networks, and the Internet can be utilized to su...
Jiazhen Zhou, C. Beard
SPIRE
2010
Springer
15 years 2 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
TELSYS
2010
122views more  TELSYS 2010»
15 years 2 months ago
Transmission scheduling for multi-homed transport protocols with network failure tolerance
In heterogeneous network environments, the network connections of a multi-homed device may have significant bandwidth differential. For a multihomed transmission protocol designed ...
Yuansong Qiao, Enda Fallon, John Murphy, Liam Murp...