Sciweavers

47 search results - page 3 / 10
» Deterministic random walks on the integers
Sort
View
ECCC
2010
98views more  ECCC 2010»
13 years 6 months ago
A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
Amit Chakrabarti
IJBC
2007
89views more  IJBC 2007»
13 years 6 months ago
Galton's quincunx: Random Walk or Chaos?
In 1873 Francis Galton had constructed a simple mechanical device where a ball is dropped vertically through a harrow of pins that deflect the ball sideways as it falls. Galton c...
Kevin Judd
FOCS
1994
IEEE
13 years 9 months ago
Randomized and deterministic algorithms for geometric spanners of small diameter
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
CC
2010
Springer
117views System Software» more  CC 2010»
13 years 3 months ago
Efficiently Certifying Non-Integer Powers
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Erich Kaltofen, Mark Lavin
JSAC
2010
188views more  JSAC 2010»
13 years 1 months ago
Random-walk based approach to detect clone attacks in wireless sensor networks
Abstract--Wireless sensor networks (WSNs) deployed in hostile environments are vulnerable to clone attacks. In such attack, an adversary compromises a few nodes, replicates them, a...
Yingpei Zeng, Jiannong Cao, Shigeng Zhang, Shanqin...