Sciweavers

1578 search results - page 58 / 316
» Algorithmic randomness of continuous functions
Sort
View
ICIP
1998
IEEE
15 years 11 months ago
Adaptive Restoration of Speckled SAR Images using a Compound Random Markov Field
This paper proposes a restoration scheme for noisy images generated by coherent imaging systems (e.g., synthetic aperture radar, synthetic aperture sonar, ultrasound imaging, and ...
José M. B. Dias, José M. N. Leit&ati...
CORR
2008
Springer
77views Education» more  CORR 2008»
14 years 9 months ago
Optimal hash functions for approximate closest pairs on the n-cube
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
Daniel M. Gordon, Victor Miller, Peter Ostapenko
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 3 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
PPSN
2004
Springer
15 years 3 months ago
Distribution Tree-Building Real-Valued Evolutionary Algorithm
This article describes a new model of probability density function and its use in estimation of distribution algorithms. The new model, the distribution tree, has interesting prope...
Petr Posik
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 9 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert