Sciweavers

1395 search results - page 189 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
ICASSP
2009
IEEE
14 years 7 months ago
On the recovery of nonnegative sparse vectors from sparse measurements inspired by expanders
This paper studies compressed sensing for the recovery of non-negative sparse vectors from a smaller number of measurements than the ambient dimension of the unknown vector. We fo...
M. Amin Khajehnejad, Babak Hassibi
CPC
2010
117views more  CPC 2010»
14 years 7 months ago
On the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
FSTTCS
2010
Springer
14 years 7 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
SIAMCO
2010
127views more  SIAMCO 2010»
14 years 4 months ago
Tracking with Prescribed Transient Performance for Hysteretic Systems
Tracking of reference signals (assumed bounded with essentially bounded derivative) is considered for a class of single-input, single-output, nonlinear systems, described by a func...
Achim Ilchmann, Hartmut Logemann, Eugene P. Ryan
INFOCOM
2011
IEEE
14 years 1 months ago
Sensor localization with deterministic accuracy guarantee
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...
Ryo Sugihara, Rajesh K. Gupta