Sciweavers

8431 search results - page 1195 / 1687
» Algorithmically Independent Sequences
Sort
View
LATIN
2010
Springer
16 years 1 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...
ICML
2009
IEEE
16 years 1 months ago
Grammatical inference as a principal component analysis problem
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
Raphaël Bailly, François Denis, Liva R...
FOCS
2009
IEEE
16 years 1 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
INFOCOM
2009
IEEE
16 years 1 months ago
To Cache or Not To Cache?
—We address cooperative caching in mobile ad hoc networks where information is exchanged in a peer-to-peer fashion among the network nodes. Our objective is to devise a fully-dis...
Marco Fiore, Francesco Mininni, Claudio Casetti, C...
IROS
2009
IEEE
129views Robotics» more  IROS 2009»
16 years 1 months ago
Lane boundary and curb estimation with lateral uncertainties
— This paper describes an algorithm for estimating lane boundaries and curbs from a moving vehicle using noisy observations and a probabilistic model of curvature. The primary co...
Albert S. Huang, Seth J. Teller
« Prev « First page 1195 / 1687 Last » Next »