Sciweavers

336 search results - page 47 / 68
» Effective Randomness for Computable Probability Measures
Sort
View
IJRR
2010
185views more  IJRR 2010»
13 years 6 months ago
FISST-SLAM: Finite Set Statistical Approach to Simultaneous Localization and Mapping
The solution to the problem of mapping an environment and at the same time using this map to localize (the simultaneous localization and mapping, SLAM, problem) is a key prerequis...
Bharath Kalyan, K. W. Lee, W. Sardha Wijesoma
P2P
2005
IEEE
119views Communications» more  P2P 2005»
14 years 1 months ago
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
Search is a fundamental service in peer-to-peer (P2P) networks. However, despite numerous research efforts, efficient algorithms for guaranteed location of shared content in unst...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, As...
INFOSCALE
2006
ACM
14 years 1 months ago
A generic search strategy for large-scale real-world networks
— We consider the following situation for a given large-scale network: Starting from an initial node we move to its neighbor node and repeat that until reaching a target node. Ho...
Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kuni...
PAMI
2007
123views more  PAMI 2007»
13 years 7 months ago
Unsupervised Statistical Segmentation of Nonstationary Images Using Triplet Markov Fields
—Recent developments in statistical theory and associated computational techniques have opened new avenues for image modeling as well as for image segmentation techniques. Thus, ...
Dalila Benboudjema, Wojciech Pieczynski
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...