Sciweavers

1369 search results - page 164 / 274
» Lattice computations for random numbers
Sort
View
ADHOCNOW
2004
Springer
14 years 2 months ago
Connectivity of Wireless Sensor Networks with Constant Density
We consider a wireless sensor network in which each sensor is able to transmit within a disk of radius one. We show with elementary techniques that there exists a constant c such t...
Sarah Carruthers, Valerie King
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 2 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
PCI
2001
Springer
14 years 1 months ago
An Experimental Evaluation of a Monte-Carlo Algorithm for Singular Value Decomposition
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
Petros Drineas, Eleni Drinea, Patrick S. Huggins
FC
2000
Springer
119views Cryptology» more  FC 2000»
14 years 24 days ago
Sharing Decryption in the Context of Voting or Lotteries
Abstract. Several public key cryptosystems with additional homomorphic properties have been proposed so far. They allow to perform computation with encrypted data without the knowl...
Pierre-Alain Fouque, Guillaume Poupard, Jacques St...
AAAI
2010
13 years 10 months ago
Truth, Justice, and Cake Cutting
Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of...
Yiling Chen, John Lai, David C. Parkes, Ariel D. P...