Sciweavers

4047 search results - page 225 / 810
» The Discrete Basis Problem
Sort
View
SIGPRO
2010
135views more  SIGPRO 2010»
15 years 2 months ago
A short note on compressed sensing with partially known signal support
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
Laurent Jacques
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
15 years 10 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
DGCI
2006
Springer
15 years 8 months ago
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
Kees Joost Batenburg
ISBI
2004
IEEE
16 years 5 months ago
Reconstruction of 2D Pet Data with Monte Carlo Generated Natural Pixels
Abstract-In discrete detector PET, natural pixels are image basis functions calculated from responses of detector pairs. By using reconstruction with natural pixels the discretizat...
Charles L. Byrne, Stefaan Vandenberghe, Edward J. ...
SODA
2010
ACM
163views Algorithms» more  SODA 2010»
16 years 1 months ago
Geometric optimization and sums of algebraic functions
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
Antoine Vigneron