Sciweavers

2479 search results - page 211 / 496
» Random Event Structures
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 8 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
INFOCOM
2006
IEEE
16 years 16 days ago
Information Dissemination in Power-Constrained Wireless Networks
— Dissemination of common information through broadcasting is an integral part of wireless network operations such as query of interested events, resource discovery and code upda...
Rong Zheng
ACIVS
2006
Springer
16 years 15 days ago
Adaptive Vision Leveraging Digital Retinas: Extracting Meaningful Segments
In general, the less probable an event, the more attention we pay to it. Likewise, considering visual perception, it is interesting to regard important image features as those that...
Nicolas Burrus, Thierry M. Bernard
EVOW
2005
Springer
16 years 1 days ago
Granular Sampling Using a Pulse-Coupled Network of Spiking Neurons
Abstract. We present a new technique for granular sampling using a pulsecoupled network of spiking artificial neurons to generate grain events. The system plays randomly selected s...
Eduardo Reck Miranda, John Matthias
AIIDE
2006
15 years 8 months ago
Plausible Environment Reconstruction Using Bayesian Networks
To save precious time and space, many games and simulations use static terrain and fixed (or random) reconstruction of areas that a player leaves and later revisits. This can resu...
Robert G. Price, Scott D. Goodwin