Sciweavers

801 search results - page 131 / 161
» Minimal Locked Trees
Sort
View
FOCS
1999
IEEE
15 years 2 months 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
SIGMOD
1999
ACM
132views Database» more  SIGMOD 1999»
15 years 2 months ago
Mind Your Vocabulary: Query Mapping Across Heterogeneous Information Sources
In this paper we present a mechanism for translating constraint queries, i.e., Boolean expressions of constraints, across heterogeneous information sources. Integrating such syste...
Kevin Chen-Chuan Chang, Hector Garcia-Molina
IWCC
1999
IEEE
15 years 1 months ago
Optimizing User-Level Communication Patterns on the Fujitsu AP3000
In this paper, we present techniques and algorithms to improve the performance of various communication patterns on message-passing platforms where, for reasons of safety, user-le...
Jeremy E. Dawson, Peter E. Strazdins
79
Voted
IPPS
1998
IEEE
15 years 1 months ago
The Effect of the Router Arbitration Policy on the Scalability of ServerNet
In this paper we extend a previously introduced method for optimizing the arbitration policy employed by ServerNet routers and we evaluate the method's effect on scalability....
Vladimir Shurbanov, Dimiter R. Avresky, Robert W. ...
DEXA
1998
Springer
140views Database» more  DEXA 1998»
15 years 1 months ago
An Analytical Study of Object Identifier Indexing
The object identifier index of an object-oriented database system is typically 20% of the size of the database itself, and for large databases, only a small part of the index fits...
Kjetil Nørvåg, Kjell Bratbergsengen