Sciweavers

103 search results - page 15 / 21
» The Cover Time of Random Digraphs
Sort
View
EUROCRYPT
2003
Springer
14 years 2 months ago
Why Provable Security Matters?
Abstract. Recently, methods from provable security, that had been developped for the last twenty years within the research community, have been extensively used to support emerging...
Jacques Stern
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 10 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
INFOCOM
2007
IEEE
14 years 3 months ago
Broadcast Flooding Revisited: Survivability and Latency
—This paper addresses the dynamics of broadcast flooding in random wireless ad hoc networks. In particular, we study the subset of nodes covered by a flood as well as timing is...
Petteri Mannersalo, Alireza Keshavarz-Haddad, Rudo...
ALGOSENSORS
2006
Springer
14 years 22 days ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
VLDB
1998
ACM
110views Database» more  VLDB 1998»
14 years 1 months ago
Massive Stochastic Testing of SQL
Deterministic testing of SQL database systems is human intensive and cannot adequately cover the SQL input domain. A system (RAGS), was built to stochastically generate valid SQL ...
Donald R. Slutz