221 search results - page 28 / 45 » On Approximating the Radii of Point Sets in High Dimensions |
100
click to vote
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is ea...
89
Voted
ALGORITHMICA
2010
14 years 10 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
78
Voted
ACCV
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. This paper addresses the problem of super resolution - obtaining a single high-resolution image given a set of low resolution images which are related by small displaceme...
63
Voted
IJON
1998
14 years 10 months ago
1998
The method presented here is aimed to a direct fast setting of the parameters of a RBF network for function approximation. It is based on a hierarchical gridding of the input spac...
73
Voted
WADS
2001
Springer
15 years 2 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...