Sciweavers

630 search results - page 77 / 126
» Optimized union of non-disjoint distributed data sets
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
A clustering based framework for dictionary block structure identification
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
Ender M. Eksioglu
ISBI
2009
IEEE
16 years 29 days ago
Improving M/EEG Source Localization with an Inter-Condition Sparse Prior
The inverse problem with distributed dipoles models in M/EEG is strongly ill-posed requiring to set priors on the solution. Most common priors are based on a convenient ℓ2 norm....
Alexandre Gramfort, Matthieu Kowalski
ACMMSP
2004
ACM
131views Hardware» more  ACMMSP 2004»
15 years 11 months ago
Reuse-distance-based miss-rate prediction on a per instruction basis
Feedback-directed optimization has become an increasingly important tool in designing and building optimizing compilers. Recently, reuse-distance analysis has shown much promise i...
Changpeng Fang, Steve Carr, Soner Önder, Zhen...
PAMI
2012
13 years 8 months ago
Fast Joint Estimation of Silhouettes and Dense 3D Geometry from Multiple Images
—We propose a probabilistic formulation of joint silhouette extraction and 3D reconstruction given a series of calibrated 2D images. Instead of segmenting each image separately i...
Kalin Kolev, Thomas Brox, Daniel Cremers
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
15 years 4 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu