Sciweavers

10051 search results - page 1623 / 2011
» A Dynamic Separator Algorithm
Sort
View
HT
1997
ACM
15 years 8 months ago
What the Query Told the Link: The Integration of Hypertext and Information Retrieval
Traditionally hypertexts have been limited in size by the manual effort required to create hypertext links. In addition, large hyper–linked collections may overwhelm users with ...
Gene Golovchinsky
IPPS
1996
IEEE
15 years 8 months ago
Software Techniques for Improving MPP Bulk-Transfer Performance
Brewer and Kuszmaul [BK94] demonstrated how barriers and traffic interleaving can alleviate the problem of bulk-transfer performance degradation on the Thinking Machines CM-5, by ...
Eric A. Brewer, Paul Gauthier, Armando Fox, Angela...
LCN
1996
IEEE
15 years 8 months ago
An Enhanced Timed-Round-Robin Traffic Control Scheme for ATM Networks
ATM (asynchronous transfer mode) aims at providing both guaranteed bandwidth to support real-time communications and dynamic bandwidth sharing to accommodate bursty data traffic. ...
Qin Zheng
133
Voted
PDIS
1996
IEEE
15 years 8 months ago
Scrambling Query Plans to Cope With Unexpected Delays
Accessing data from numerous widely-distributed sources poses signi cant new challenges for query optimization and execution. Congestion and failures in the network can introduce ...
Laurent Amsaleg, Michael J. Franklin, Anthony Toma...
171
Voted
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 8 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
« Prev « First page 1623 / 2011 Last » Next »