Sciweavers

1538 search results - page 45 / 308
» Relative Randomness and Cardinality
Sort
View
PAMI
2010
164views more  PAMI 2010»
14 years 10 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
ACRI
2004
Springer
15 years 5 months ago
Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics
Abstract. We outline the basic principles of neuropercolation, a generalized percolation model motivated by the dynamical properties of the neuropil, the densely interconnected neu...
Robert Kozma, Marko Puljic, Paul Balister, B&eacut...
TSMC
2002
69views more  TSMC 2002»
14 years 11 months ago
A new learning algorithm for the hierarchical structure learning automata operating in the nonstationary S-model random environm
An extended algorithm of the relative reward strength algorithm is proposed. It is shown that the proposed algorithm ensures the convergence with probability 1 to the optimal path ...
Norio Baba, Yoshio Mogami
MA
2010
Springer
206views Communications» more  MA 2010»
14 years 10 months ago
Quantization and clustering with Bregman divergences
 This paper deals with the quantization problem of a random variable X taking values in a separable and reexive Banach space, and with the related question of clustering independ...
Aurélie Fischer
ISAAC
2010
Springer
266views Algorithms» more  ISAAC 2010»
14 years 9 months ago
Structural and Complexity Aspects of Line Systems of Graphs
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
Jozef Jirásek, Pavel Klavík