Sciweavers

886 search results - page 60 / 178
» On the Autoreducibility of Random Sequences
Sort
View
CPC
2007
97views more  CPC 2007»
13 years 8 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger
SIGECOM
2008
ACM
158views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Information revelation and random entry in sequential ascending auctions
We examine a model in which multiple buyers with single-unit demand are faced with an infinite sequence of auctions. New buyers arrive on the market probabilistically, and are each...
Maher Said
FSE
2001
Springer
109views Cryptology» more  FSE 2001»
14 years 12 days ago
Bias in the LEVIATHAN Stream Cipher
We show two methods of distinguishing the LEVIATHAN stream cipher from a random stream using 236 bytes of output and proportional effort; both arise from compression within the ci...
Paul Crowley, Stefan Lucks
ECCV
2000
Springer
14 years 9 months ago
Quasi-Random Sampling for Condensation
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implemen...
Vasanth Philomin, Ramani Duraiswami, Larry S. Davi...
IM
2006
13 years 8 months ago
Protean Graphs
We propose a new random model of web graphs in which the degree of a vertex depends on its age. We characterize the degree sequence of this model and study its behaviour near the c...
Tomasz Luczak, Pawel Pralat