Sciweavers

3341 search results - page 590 / 669
» On Bounded Queries and Approximation
Sort
View
ESA
2008
Springer
94views Algorithms» more  ESA 2008»
14 years 11 months ago
Relative Convex Hulls in Semi-dynamic Subdivisions
Abstract. We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subd...
Mashhood Ishaque, Csaba D. Tóth
CDES
2008
123views Hardware» more  CDES 2008»
14 years 11 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
GRAPHICSINTERFACE
2007
14 years 11 months ago
Surface distance maps
We present an interactive algorithm to compute surface distance maps for triangulated models. The distance map represents the distance-to-closest-primitive mapping at each point o...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, E...
CCCG
2006
14 years 11 months ago
2D Triangulation Representation Using Stable Catalogs
The problem of representing triangulations has been widely studied to obtain convenient encodings and space efficient data structures. In this paper we propose a new practical app...
Abdelkrim Mebarki, Luca Castelli Aleardi, Olivier ...
NIPS
2004
14 years 11 months ago
Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...