Sciweavers

397 search results - page 58 / 80
» Pseudorandom Functions and Lattices
Sort
View
ACRI
2004
Springer
15 years 6 months ago
Perturbing the Topology of the Game of Life Increases Its Robustness to Asynchrony
An experimental analysis of the asynchronous version of the “Game of Life” is performed to estimate how topology perturbations modify its evolution. We focus on the study of a ...
Nazim Fatès, Michel Morvan
ECCC
2011
207views ECommerce» more  ECCC 2011»
14 years 8 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
ICASSP
2008
IEEE
15 years 7 months ago
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
Herve Jegou, Laurent Amsaleg, Cordelia Schmid, Pat...
AIMSA
2000
Springer
15 years 5 months ago
Coverage-Based Semi-distance between Horn Clauses
In the present paper we use the approach of height functions to de ning a semi-distance measure between Horn clauses. This appraoch is already discussed elsewhere in the framework ...
Zdravko Markov, Ivo Marinchev
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 1 months ago
Directed animals in the gas
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert