Sciweavers

2485 search results - page 3 / 497
» A Communicating Tree Model for Generating Network Applicatio...
Sort
View
ICC
2007
IEEE
180views Communications» more  ICC 2007»
14 years 1 months ago
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
Murat Demirbas, Xuming Lu
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 6 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
EMNLP
2007
13 years 9 months ago
Large Margin Synchronous Generation and its Application to Sentence Compression
This paper presents a tree-to-tree transduction method for text rewriting. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of...
Trevor Cohn, Mirella Lapata
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
13 years 11 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson
SASO
2007
IEEE
14 years 1 months ago
In Search of Simplicity: A Self-Organizing Group Communication Overlay
Group communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support ...
Matei Ripeanu, Adriana Iamnitchi, Ian T. Foster, A...