Sciweavers

164 search results - page 15 / 33
» Adaptive Algorithms for Planar Convex Hull Problems
Sort
View
ALGORITHMICA
1999
141views more  ALGORITHMICA 1999»
13 years 7 months ago
Design and Implementation of a Practical Parallel Delaunay Algorithm
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Mil...
MST
2002
169views more  MST 2002»
13 years 7 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...
PAMI
2006
114views more  PAMI 2006»
13 years 7 months ago
Nonparametric Supervised Learning by Linear Interpolation with Maximum Entropy
Nonparametric neighborhood methods for learning entail estimation of class conditional probabilities based on relative frequencies of samples that are "near-neighbors" of...
Maya R. Gupta, Robert M. Gray, Richard A. Olshen
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 2 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin
FAW
2009
Springer
177views Algorithms» more  FAW 2009»
14 years 2 months ago
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong ...