Sciweavers

2079 search results - page 386 / 416
» Universality of random graphs
Sort
View
174
Voted
SPAA
2006
ACM
16 years 16 days ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
SP
2005
IEEE
156views Security Privacy» more  SP 2005»
16 years 5 days ago
Distributed Detection of Node Replication Attacks in Sensor Networks
The low-cost, off-the-shelf hardware components in unshielded sensor-network nodes leave them vulnerable to compromise. With little effort, an adversary may capture nodes, analyze...
Bryan Parno, Adrian Perrig, Virgil D. Gligor
ANCS
2005
ACM
16 years 4 days ago
Resource mapping and scheduling for heterogeneous network processor systems
Task to resource mapping problems are encountered during (i) hardware-software co-design and (ii) performance optimization of Network Processor systems. The goal of the first pro...
Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinh...
IPSN
2005
Springer
16 years 2 days ago
Geographic routing with limited information in sensor networks
Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information ab...
Sundar Subramanian, Sanjay Shakkottai
COMPGEOM
2010
ACM
15 years 11 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir