Sciweavers

3244 search results - page 108 / 649
» On convex complexity measures
Sort
View
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 ...
93
Voted
MFCS
1994
Springer
15 years 5 months ago
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams
We show that the wavefront approach to Voronoi diagrams (a deterministic line sweep algorithm that does not use geometric transform) can be generalized to distance measures more g...
Frank K. H. A. Dehne, Rolf Klein
TSP
2010
14 years 8 months ago
Methods for sparse signal recovery using Kalman filtering with embedded pseudo-measurement norms and quasi-norms
We present two simple methods for recovering sparse signals from a series of noisy observations. The theory of compressed sensing (CS) requires solving a convex constrained minimiz...
Avishy Carmi, Pini Gurfil, Dimitri Kanevsky
101
Voted
INFSOF
1998
78views more  INFSOF 1998»
15 years 1 months ago
Program slices as an abstraction for cohesion measurement
Slices as an Abstraction for Cohesion Measurement Linda M. Ott Michigan Technological University James M. Bieman Colorado State University The basis for measuring many attributes ...
Linda M. Ott, James M. Bieman
EUROPAR
2010
Springer
15 years 2 months ago
Sampling Bias in BitTorrent Measurements
Abstract. Real-world measurements play an important role in understanding the characteristics and in improving the operation of BitTorrent, which is currently a popular Internet ap...
Boxun Zhang, Alexandru Iosup, Johan A. Pouwelse, D...