Sciweavers

11151 search results - page 154 / 2231
» On the Complexity of Model Expansion
Sort
View
ICASSP
2008
IEEE
15 years 11 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...
PAKDD
2000
ACM
128views Data Mining» more  PAKDD 2000»
15 years 8 months ago
Efficient Detection of Local Interactions in the Cascade Model
Detection of interactions among data items constitutes an essential part of knowledge discovery. The cascade model is a rule induction methodology using levelwise expansion of a la...
Takashi Okada
FSTTCS
1995
Springer
15 years 8 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
ASMTA
2008
Springer
100views Mathematics» more  ASMTA 2008»
15 years 6 months ago
A Tandem Queueing Model for Delay Analysis in Disconnected Ad Hoc Networks
Ad hoc network routing protocols may fail to operate in the absence of an end-to-end connection from source to destination. This deficiency can be resolved by so-called delay-toler...
Ahmad Al Hanbali, Roland de Haan, Richard J. Bouch...
NIPS
2007
15 years 6 months ago
Loop Series and Bethe Variational Bounds in Attractive Graphical Models
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
Erik B. Sudderth, Martin J. Wainwright, Alan S. Wi...