Sciweavers

13 search results - page 1 / 3
» algorithmica 1998
Sort
View
ALGORITHMICA
1998
79views more  ALGORITHMICA 1998»
14 years 10 months ago
Finding Largest Subtrees and Smallest Supertrees
Arvind Gupta, Naomi Nishimura
ALGORITHMICA
1998
76views more  ALGORITHMICA 1998»
14 years 10 months ago
On Learning Decision Trees with Large Output Domains
Nader H. Bshouty, Christino Tamon, David K. Wilson
91
Voted
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
14 years 10 months ago
A Note on Point Location in Delaunay Triangulations of Random Points
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
Luc Devroye, Ernst P. Mücke, Binhai Zhu
ALGORITHMICA
1998
75views more  ALGORITHMICA 1998»
14 years 10 months ago
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
Susanne Albers, Michael Mitzenmacher