Sciweavers

2100 search results - page 65 / 420
» Fundamentals of the problem
Sort
View
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
14 years 3 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
MFCS
2004
Springer
14 years 3 months ago
Online Algorithms for Disk Graphs
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
Ioannis Caragiannis, Aleksei V. Fishkin, Christos ...
FTDCS
1997
IEEE
14 years 2 months ago
Protocols versus Objects: Can Models for Telecommunications and Distributed Processing Coexist?
This paper identifies two paradigms that influence the design of telematics systems nowadays: the protocol-centred and the object-centred paradigm. Both paradigms have been intr...
Marten van Sinderen, Luís Ferreira Pires
ANTSW
2008
Springer
13 years 11 months ago
The Architecture of Ant-Based Clustering to Improve Topographic Mapping
Abstract. This paper analyzes the popular ant-based clustering approach of Lumer/Faieta. Analysis of formulae unveils that ant-based clustering is strongly related to Kohonen’s S...
Lutz Herrmann, Alfred Ultsch
VLDB
2006
ACM
190views Database» more  VLDB 2006»
14 years 10 months ago
Online summarization of dynamic time series data
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
Ümit Y. Ogras, Hakan Ferhatosmanoglu