Sciweavers

18 search results - page 3 / 4
» algorithmica 1999
Sort
View
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 7 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye
ALGORITHMICA
1999
112views more  ALGORITHMICA 1999»
13 years 7 months ago
Suffix Trees on Words
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...
Arne Andersson, N. Jesper Larsson, Kurt Swanson
ALGORITHMICA
1999
84views more  ALGORITHMICA 1999»
13 years 7 months ago
Computational Approaches to Drug Design
Abstract. The rational approach to pharmaceutical drug design begins with an investigation of the relationship between chemical structure and biological activity. Information gaine...
Paul W. Finn, Lydia E. Kavraki
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
13 years 7 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
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...