Sciweavers

32545 search results - page 74 / 6509
» Data Structures and Algorithms
Sort
View
STACS
2001
Springer
15 years 7 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
131
Voted
CGI
1998
IEEE
15 years 6 months ago
Graph-Based Surface Reconstruction Using Structures in Scattered Point Sets
We present an algorithm for the reconstruction of a surface from an unorganized set of points in space. The point data may be obtained from a laser range scanner or any other digi...
Robert Mencl, Heinrich Müller
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 3 months ago
Distribution-sensitive point location in convex subdivisions
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
Sébastien Collette, Vida Dujmovic, John Iac...
116
Voted
ICDM
2003
IEEE
104views Data Mining» more  ICDM 2003»
15 years 7 months ago
Structure Search and Stability Enhancement of Bayesian Networks
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
Hanchuan Peng, Chris H. Q. Ding
UAI
2000
15 years 3 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore