Sciweavers

2354 search results - page 132 / 471
» Randomness, Stochasticity and Approximations
Sort
View
IJON
2007
81views more  IJON 2007»
13 years 9 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 8 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
TIP
2011
89views more  TIP 2011»
13 years 4 months ago
Random Phase Textures: Theory and Synthesis
This paper explores the mathematical and algorithmic properties of two sample-based microtexture models: random phase noise (RPN ) and asymptotic discrete spot noise (ADSN ). Thes...
Bruno Galerne, Yann Gousseau, Jean-Michel Morel
ALGORITHMICA
2007
117views more  ALGORITHMICA 2007»
13 years 9 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...
AMDO
2010
Springer
13 years 8 months ago
Estimating 3D Pose via Stochastic Search and Expectation Maximization
In this paper an approach is described to estimate 3D pose using a part based stochastic method. A proposed representation of the human body is explored defined over joints that e...
Ben Daubney, Xianghua Xie