Sciweavers

2880 search results - page 358 / 576
» Approximate Range Searching
Sort
View
111
Voted
ICML
2006
IEEE
16 years 4 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
ISBI
2004
IEEE
16 years 4 months ago
A Method for Reconstructing Label Images From a Few Projections, as Motivated by Electron Microscopy
Our aim is to produce a tessellation of space into small voxels and, based on only a few tomographic projections of an object, assign to each voxel a label that indicates one of t...
Hstau Y. Liao, Gabor T. Herman
141
Voted
WWW
2005
ACM
16 years 4 months ago
Automated semantic web services orchestration via concept covering
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
DCC
2002
IEEE
16 years 3 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
ICASSP
2009
IEEE
15 years 10 months ago
Document reconstruction using dynamic programming
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...
Andre Pimenta, Edson J. R. Justino, Luiz S. Olivei...