229 search results - page 3 / 46 » Ergodic-Type Characterizations of Algorithmic Randomness |
TSP
2010
13 years 9 days ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
FOCM
2007
13 years 5 months ago
2007
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
INFOCOM
2012
IEEE
11 years 8 months ago
2012
IEEE
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
COCOON
2005
Springer
13 years 7 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
ICCV
2009
IEEE
13 years 3 months ago
2009
IEEE
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...