Sciweavers

15782 search results - page 3139 / 3157
» Network Optimization and Control
Sort
View
IPPS
1999
IEEE
14 years 28 days ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
CIKM
1998
Springer
14 years 26 days ago
Selectivity Estimation of Window Queries
Despite of the fact that large line segment datasets are appearing more and more frequently in numerous applications involving spatial data, such as GIS 8, 9] multimedia 6] and ev...
Guido Proietti, Christos Faloutsos
RANDOM
1998
Springer
14 years 25 days ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
PPOPP
1997
ACM
14 years 24 days ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon
MOBICOM
1996
ACM
14 years 23 days ago
Building Reliable Mobile-Aware Applications Using the Rover Toolkit
This paper discusses extensions to the Rover toolkit for constructing reliable mobile-aware applications. The extensions improve upon the existing failure model, which only addres...
Anthony D. Joseph, M. Frans Kaashoek
« Prev « First page 3139 / 3157 Last » Next »