458 search results - page 54 / 92 » Linear Time Algorithms for Clustering Problems in Any Dimens... |
CPM
2006
Springer
14 years 6 days ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
SIGGRAPH
2000
ACM
14 years 1 days ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
CAL
2002
13 years 8 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
A new multimedia disk scheduling algorithm, termed Cascaded-SFC, is presented. The Cascaded-SFC multimedia disk scheduler is applicable in environments where multimedia data reque...