Sciweavers

574 search results - page 56 / 115
» Sequential Compressed Sensing
Sort
View
AAAI
2010
13 years 9 months ago
Compressing POMDPs Using Locality Preserving Non-Negative Matrix Factorization
Partially Observable Markov Decision Processes (POMDPs) are a well-established and rigorous framework for sequential decision-making under uncertainty. POMDPs are well-known to be...
Georgios Theocharous, Sridhar Mahadevan
DCC
2004
IEEE
14 years 7 months ago
Online Suffix Trees with Counts
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
Breanndán Ó Nualláin, Steven ...
DM
2008
89views more  DM 2008»
13 years 8 months ago
Combinatorics of sequential dynamical systems
In this paper we study sequential dynamical systems (SDS) over words. Our main result is the classification of SDS over words for fixed graphY and family of local maps (Fvi ) by m...
Christian M. Reidys
ICASSP
2008
IEEE
14 years 2 months ago
Subspace compressive detection for sparse signals
The emerging theory of compressed sensing (CS) provides a universal signal detection approach for sparse signals at sub-Nyquist sampling rates. A small number of random projection...
Zhongmin Wang, Gonzalo R. Arce, Brian M. Sadler
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 8 months ago
Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks
We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...
Paolo Boldi, Marco Rosa, Massimo Santini, Sebastia...