Sciweavers

221 search results - page 28 / 45
» On Approximating the Radii of Point Sets in High Dimensions
Sort
View
EDBT
2008
ACM
178views Database» more  EDBT 2008»
14 years 7 months ago
Compacting music signatures for efficient music retrieval
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...
Bin Cui, H. V. Jagadish, Beng Chin Ooi, Kian-Lee T...
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
13 years 7 months ago
Computing the Greedy Spanner in Near-Quadratic Time
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...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...
ACCV
2006
Springer
14 years 1 months ago
Super Resolution Using Graph-Cut
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...
Uma Mudenagudi, Ram Singla, Prem Kumar Kalra, Subh...
IJON
1998
44views more  IJON 1998»
13 years 7 months ago
Hierarchical RBF networks and local parameters estimate
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...
N. Alberto Borghese, Stefano Ferrari
WADS
2001
Springer
113views Algorithms» more  WADS 2001»
14 years 2 days ago
Movement Planning in the Presence of Flows
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...
John H. Reif, Zheng Sun