Sciweavers

627 search results - page 64 / 126
» Kolmogorov-Loveland Randomness and Stochasticity
Sort
View
AAAI
2012
11 years 10 months ago
Robust Cuts Over Time: Combatting the Spread of Invasive Species with Unreliable Biological Control
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
Gwen Spencer
IJON
2007
81views more  IJON 2007»
13 years 7 months ago
Statistical analysis of spatially embedded networks: From grid to random node positions
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
Nicole Voges, Ad Aertsen, Stefan Rotter
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
ALGORITHMICA
2007
117views more  ALGORITHMICA 2007»
13 years 7 months ago
Random Geometric Graph Diameter in the Unit Ball
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...
Robert B. Ellis, Jeremy L. Martin, Catherine H. Ya...
ICPR
2002
IEEE
14 years 8 months ago
Face Detection and Synthesis Using Markov Random Field Models
Markov Random Fields (MRFs) are proposed as viable stochastic models for the spatial distribution of gray level intensities for images of human faces. These models are trained usi...
Sarat C. Dass, Anil K. Jain, Xiaoguang Lu