Sciweavers

1261 search results - page 99 / 253
» Approximation algorithms for aligning points
Sort
View
NA
2007
80views more  NA 2007»
14 years 9 months ago
Image reconstruction by OPED algorithm with averaging
Abstract. OPED is a new image reconstruction algorithm based on orthogonal polynomial expansion on the disk. We show that the integral of the approximation function in OPED can be ...
Yuan Xu, Oleg Tischenko, Christoph Hoeschen
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
15 years 1 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
COCOA
2008
Springer
14 years 11 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
ROBOTICA
2002
112views more  ROBOTICA 2002»
14 years 9 months ago
Adaptation of Lowe's camera pose recovery algorithm to mobile robot self-localisation
: This paper presents an adaptation of Lowe's numerical model-based camera localisation algorithm to the domain of indoor mobile robotics. While the original method is straigh...
Omar Ait-Aider, Philippe Hoppenot, Etienne Colle
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
14 years 10 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo