Sciweavers

5128 search results - page 376 / 1026
» Discrete Component Analysis
Sort
View
222
Voted
ICIP
2002
IEEE
16 years 9 months ago
Multiresolution 3D mesh compression
In this paper, we propose an efficient low complexity compression scheme for densely sampled irregular 3D meshes. This scheme is based on 3D multiresolution analysis (3D Discrete ...
Frédéric Payan, Marc Antonini
201
Voted
ISBI
2004
IEEE
16 years 8 months ago
Speckle Reduction on Ultrasound Image by Variational Methods and Adaptive Lagrangian Multipliers
Ultrasound images are corrupted by a multiplicative noise, the speckle, which makes high level analysis difficult. Within each resolution cell a number of elementary scatterers re...
Arnaud Ogier, Pierre Hellier, Christian Barillot
232
Voted
PODC
2009
ACM
16 years 8 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
364
Voted
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 7 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
MOBIHOC
2007
ACM
16 years 7 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...