Sciweavers

4463 search results - page 392 / 893
» computing 2000
Sort
View
IDA
2000
Springer
15 years 6 months ago
Relation-based aggregation: finding objects in large spatial datasets
Regularities exist in datasets describing spatially distributed physical phenomena. Human experts often understand alize the regularities as abstract spatial objects evolving coher...
Xingang Huang, Feng Zhao
179
Voted
IPL
2000
82views more  IPL 2000»
15 years 6 months ago
Estimating the number of vertices of a polyhedron
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...
David Avis, Luc Devroye
ISCI
2000
79views more  ISCI 2000»
15 years 6 months ago
Data block prefetching and caching in a hierarchical storage model
Storage subsystems have become one of the most important components in computer systems nowadays and have been expanded to include all three levels of memory hierarchy, namely the...
Athena Vakali
ITA
2000
15 years 6 months ago
Iteration of rational transductions
The purpose of this paper is to show connections between iterated length-preserving rational transductions and linear space computations. Hence, we study the smallest family of tr...
Alain Terlutte, David Simplot
JACM
2000
119views more  JACM 2000»
15 years 6 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle