Sciweavers

4047 search results - page 172 / 810
» The Discrete Basis Problem
Sort
View
COCOA
2009
Springer
15 years 4 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
ICIP
2009
IEEE
16 years 2 months ago
Dequantizing Compressed Sensing With Non-gaussian Constraints
In this paper, following the Compressed Sensing (CS) paradigm, we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present ...
ETS
2006
IEEE
119views Hardware» more  ETS 2006»
15 years 7 months ago
On-Chip Test Generation Using Linear Subspaces
A central problem in built-in self test (BIST) is how to efficiently generate a small set of test vectors that detect all targeted faults. We propose a novel solution that uses l...
Ramashis Das, Igor L. Markov, John P. Hayes
CAIP
2003
Springer
148views Image Analysis» more  CAIP 2003»
15 years 6 months ago
Construction of Complete and Independent Systems of Rotation Moment Invariants
The problem of independence and completeness of rotation moment invariants is addressed in this paper. General method for constructing invariants of arbitrary orders by means of co...
Jan Flusser, Tomás Suk
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 1 months ago
Quantifying Homology Classes
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
Chao Chen, Daniel Freedman