Sciweavers

1083 search results - page 143 / 217
» On the Number of Optimal Base 2 Representations of Integers
Sort
View
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
15 years 4 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
FOCS
2007
IEEE
15 years 1 months ago
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
Arkadev Chattopadhyay
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
15 years 3 months ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg
ICC
2008
IEEE
138views Communications» more  ICC 2008»
15 years 4 months ago
Designing File Replication Schemes for Peer-to-Peer File Sharing Systems
—Peer-to-peer (P2P) file sharing systems are becoming increasingly popular due to their flexibility and scalability. We propose a new model to design file replication schemes ...
Jian Ni, Jie Lin, S. J. Harrington, Naveen Sharma
COMPGEOM
2000
ACM
15 years 2 months ago
Kinetic connectivity for unit disks
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
Leonidas J. Guibas, John Hershberger, Subhash Suri...