Sciweavers

952 search results - page 63 / 191
» TreeFam: 2008 Update
Sort
View
127
Voted
WINET
2008
106views more  WINET 2008»
15 years 3 months ago
Octopus: A fault-tolerant and efficient ad-hoc routing protocol
Mobile ad-hoc networks (MANETs) are failure-prone environments; it is common for mobile wireless nodes to intermittently disconnect from the network, e.g., due to signal blockage....
Roie Melamed, Idit Keidar, Yoav Barel
120
Voted
PVLDB
2008
112views more  PVLDB 2008»
15 years 3 months ago
P2P logging and timestamping for reconciliation
In this paper, we address data reconciliation in peer-to-peer (P2P) collaborative applications. We propose P2P-LTR (Logging and Timestamping for Reconciliation) which provides P2P...
Mounir Tlili, William Kokou Dedzoe, Esther Pacitti...
142
Voted
NETWORKING
2008
15 years 5 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
102
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 3 months ago
On Dynamic Breadth-First Search in External-Memory
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monot...
Ulrich Meyer
233
Voted
GIS
2008
ACM
16 years 4 months ago
Should SDBMS support a join index?: a case study from CrimeStat
Given a spatial crime data warehouse, that is updated infrequently and a set of operations O as well as constraints of storage and update overheads, the index type selection probl...
Pradeep Mohan, Ronald E. Wilson, Shashi Shekhar, B...