Sciweavers

1082 search results - page 129 / 217
» Approximation Algorithms for Spreading Points
Sort
View
PG
2007
IEEE
14 years 3 months ago
Fast and Faithful Geometric Algorithm for Detecting Crest Lines on Meshes
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
Shin Yoshizawa, Alexander G. Belyaev, Hideo Yokota...
DICTA
2003
13 years 10 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
ECCV
2004
Springer
14 years 11 months ago
The Quality of Catadioptric Imaging ? Application to Omnidirectional Stereo
Abstract. We investigate the influence of the mirror shape on the imaging quality of catadioptric sensors. For axially symmetrical mirrors we calculate the locations of the virtual...
Hansjürgen Dahmen, Hanspeter A. Mallot, Wolfg...
SIAMSC
2008
139views more  SIAMSC 2008»
13 years 9 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 2 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler