Sciweavers

359 search results - page 5 / 72
» Online Algorithms for Disk Graphs
Sort
View
76
Voted
ICPP
1998
IEEE
15 years 1 months ago
Improving Parallel-Disk Buffer Management using Randomized Writeback
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
Mahesh Kallahalla, Peter J. Varman
DIALM
2003
ACM
133views Algorithms» more  DIALM 2003»
15 years 2 months ago
Ad-hoc networks beyond unit disk graphs
In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical realworld networks whi...
Fabian Kuhn, Aaron Zollinger
SIAMDM
2008
148views more  SIAMDM 2008»
14 years 9 months ago
A New Algorithm for On-line Coloring Bipartite Graphs
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
Hajo Broersma, Agostino Capponi, Daniël Paulu...
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
15 years 9 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
107
Voted
FSTTCS
2004
Springer
15 years 2 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi