Sciweavers

97 search results - page 17 / 20
» Approximate center points with proofs
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
14 years 1 months ago
On the k-Closest Substring and k-Consensus Pattern Problems
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
Yishan Jiao, Jingyi Xu, Ming Li
ISSAC
2009
Springer
144views Mathematics» more  ISSAC 2009»
14 years 2 months ago
H-LLL: using householder inside LLL
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
Ivan Morel, Damien Stehlé, Gilles Villard
IROS
2007
IEEE
109views Robotics» more  IROS 2007»
14 years 1 months ago
A new approach to segmentation of 2D range scans into linear regions
— Toward obtaining a compact and multiresolution representation of 2D range scans, a wavelet framework is proposed for encoding an orientation measure called Running Angle (RA). ...
Ahad Harati, Roland Siegwart
SSD
2009
Springer
149views Database» more  SSD 2009»
14 years 2 months ago
Analyzing Trajectories Using Uncertainty and Background Information
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
Bart Kuijpers, Bart Moelans, Walied Othman, Alejan...