Sciweavers

1798 search results - page 286 / 360
» A Tree for All Seasons
Sort
View
ICDE
2000
IEEE
110views Database» more  ICDE 2000»
14 years 3 days ago
Optimal Index and Data Allocation in Multiple Broadcast Channels
The issue of data broadcast has received much attention in mobile computing. A periodic broadcast of frequently requested data can reduce the workload of the up-link channel and f...
Shou-Chih Lo, Arbee L. P. Chen
IPPS
2000
IEEE
14 years 2 days ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
SSDBM
2000
IEEE
87views Database» more  SSDBM 2000»
14 years 2 days ago
A Tool for Nesting and Clustering Large Objects
In implementations of non-standard database systems, large objects are often embedded within an aggregate of different types, i.e. a tuple. For a given size and access probabilit...
Stefan Dieker, Ralf Hartmut Güting, Miguel Ro...
AGENTS
2000
Springer
14 years 1 days ago
Scalability of a Transactional Infrastructure for Multi-Agent Systems
Abstract. One of the reasons for attending to agent technology is the evergrowing complexity of information systems and the increasing difficulty to foresee and plan for all potent...
Khaled Nagi
FOCS
1999
IEEE
14 years 11 hour ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl