Sciweavers

1355 search results - page 78 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
EDBTW
2006
Springer
14 years 20 days ago
Efficiently Processing XML Queries over Fragmented Repositories with PartiX
The data volume of XML repositories and the response time of query processing have become critical issues for many applications, especially for those in the Web. An interesting alt...
Alexandre Andrade, Gabriela Ruberg, Fernanda Arauj...
HOTI
2005
IEEE
14 years 2 months ago
Zero Copy Sockets Direct Protocol over InfiniBand - Preliminary Implementation and Performance Analysis
Sockets Direct Protocol (SDP) is a byte-stream transport protocol implementing the TCP SOCK_STREAM semantics utilizing transport offloading capabilities of the InfiniBand fabric. ...
Dror Goldenberg, Michael Kagan, Ran Ravid, Michael...
BROADNETS
2006
IEEE
14 years 22 days ago
On Traffic Grooming Choices for IP over WDM networks
Traffic grooming continues to be a rich area of research in the context of WDM optical networks. We provide an overview of the optical and electronic grooming techniques available...
Srivatsan Balasubramanian, Arun K. Somani
WWW
2005
ACM
14 years 9 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
SPAA
1993
ACM
14 years 1 months ago
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
Philip D. MacKenzie, Quentin F. Stout