Sciweavers

552 search results - page 78 / 111
» Lower bounds for dynamic connectivity
Sort
View
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 6 months ago
Secret Key Generation for a Pairwise Independent Network Model
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Pr...
FOCS
2007
IEEE
14 years 2 months ago
Towards Sharp Inapproximability For Any 2-CSP
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Per Austrin
CLUSTER
2005
IEEE
14 years 1 months ago
Toward an Optimal Redundancy Strategy for Distributed Computations
Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The related computation integrity concerns are commonly...
Doug Szajda, Barry Lawson, Jason Owen
IPSN
2005
Springer
14 years 1 months ago
Towards optimal sleep scheduling in sensor networks for rare-event detection
— Lifetime maximization is one key element in the design of sensor-network-based surveillance applications. We propose a protocol for node sleep scheduling that guarantees a boun...
Qing Cao, Tarek F. Abdelzaher, Tian He, John A. St...
IPPS
2000
IEEE
14 years 9 days ago
Sorting on the OTIS-Mesh
In this paper we present sorting algorithms on the recently introduced N2 processor OTIS-Mesh, a network with diameter 4 p N , 3 consisting of N connected meshes of size p N  p N...
Andre Osterloh