Sciweavers

1414 search results - page 115 / 283
» Cover Time and Broadcast Time
Sort
View
CSFW
2005
IEEE
15 years 3 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov
EACL
1993
ACL Anthology
14 years 11 months ago
New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound de...
Peter Staudacher
ADHOC
2008
59views more  ADHOC 2008»
14 years 10 months ago
Sacrificing a little coverage can substantially increase network lifetime
We present a simple, local protocol, pCover, which provides partial (but high) coverage in sensor networks. Through pCover, we demonstrate that it is feasible to maintain a high c...
Limin Wang, Sandeep S. Kulkarni
86
Voted
COMBINATORICA
2008
112views more  COMBINATORICA 2008»
14 years 10 months ago
On the rigidity of molecular graphs
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
Bill Jackson, Tibor Jordán
88
Voted
IJWIN
2006
209views more  IJWIN 2006»
14 years 10 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...