Sciweavers

423 search results - page 44 / 85
» Beta Random Projection
Sort
View
MCS
2007
Springer
15 years 8 months ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
CVPR
2008
IEEE
16 years 4 months ago
Simultaneous image transformation and sparse representation recovery
Sparse representation in compressive sensing is gaining increasing attention due to its success in various applications. As we demonstrate in this paper, however, image sparse rep...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
ICASSP
2008
IEEE
15 years 8 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
AIPS
2009
15 years 3 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
JMLR
2010
115views more  JMLR 2010»
15 years 12 days ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...