Sciweavers

152 search results - page 16 / 31
» Efficient Projection for Compressed Sensing
Sort
View
ICML
2007
IEEE
14 years 10 months ago
A novel orthogonal NMF-based belief compression for POMDPs
High dimensionality of POMDP's belief state space is one major cause that makes the underlying optimal policy computation intractable. Belief compression refers to the method...
Xin Li, William Kwok-Wai Cheung, Jiming Liu, Zhili...
LCPC
2000
Springer
14 years 1 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
DEBU
2006
85views more  DEBU 2006»
13 years 10 months ago
Generic Entity Resolution in the SERF Project
The SERF project at Stanford deals with the Entity Resolution (ER) problem, in which records determined to represent the same real-life "entities" (such as people or pro...
Omar Benjelloun, Hector Garcia-Molina, Hideki Kawa...
DCC
2008
IEEE
14 years 9 months ago
Object-Based Regions of Interest for Image Compression
A fully automated architecture for object-based region of interest (ROI) detection is proposed. ROI's are defined as regions containing user defined objects of interest, and ...
Sunhyoung Han, Nuno Vasconcelos
ICASSP
2008
IEEE
14 years 4 months ago
Wavelet-domain compressive signal reconstruction using a Hidden Markov Tree model
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...