Sciweavers

479 search results - page 93 / 96
» cn 2008
Sort
View
CN
2008
80views more  CN 2008»
14 years 10 months ago
Practical large-scale latency estimation
We present the implementation of a large-scale latency estimation system based on GNP and incorporated into the Google content delivery network. Our implementation does not rely o...
Michal Szymaniak, David L. Presotto, Guillaume Pie...
CN
2004
148views more  CN 2004»
14 years 9 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...
IJIIDS
2008
100views more  IJIIDS 2008»
14 years 10 months ago
A novel vehicle communication paradigm based on Cellular Networks for improving the safety in roads
: Main aim of Intelligent Transport Systems (ITS) applied to roads is to increase their safety. To achieve this aim, many researchers are focused on developing robust and efficient...
José Santa, Rafael Toledo-Moreo, Antonio F....
FORMATS
2008
Springer
14 years 11 months ago
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...
Alexander Rabinovich
CPC
2006
110views more  CPC 2006»
14 years 10 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin