331 search results - page 25 / 67 » New Results on the Pseudorandomness of Some Blockcipher Cons... |
AINA
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor n...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
VRML
2005
ACM
14 years 2 months ago
2005
ACM
Web-based geometry transmission profits from a transmission system, which is both progressive and compressive. For this application, the wavelet transform has emerged as a suitab...
LATIN
2010
Springer
14 years 22 days ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...