Sciweavers

957 search results - page 146 / 192
» A Probability Model for Combining Ranks
Sort
View
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
15 years 6 months ago
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca T...
ATAL
2005
Springer
15 years 5 months ago
A probabilistic approach to resource allocation in distributed fusion systems
In complex multi-agent fusion systems resource conflicts are very likely to occur. We propose an algorithm that determines the optimal sensing resource to fusion task assignment,...
Jan Nunnink, Gregor Pavlin
ECAI
2000
Springer
15 years 4 months ago
Turning High-Level Plans into Robot Programs in Uncertain Domains
The actions of a robot like lifting an object are often best thought of as low-level processes with uncertain outcome. A highlevel robot plan can be seen as a description of a task...
Henrik Grosskreutz, Gerhard Lakemeyer
RAS
2007
98views more  RAS 2007»
14 years 11 months ago
Occupancy grids building by sonar and mobile robot
In this paper, a modified method for occupancy grid map building by a moving mobile robot and a scanning ultrasonic range-finder is proposed. The map building process consists o...
Sv. Noykov, Ch. Roumenin
BMVC
2010
14 years 9 months ago
Deterministic Sample Consensus with Multiple Match Hypotheses
RANSAC (Random Sample Consensus) is a popular and effective technique for estimating model parameters in the presence of outliers. Efficient algorithms are necessary for both fram...
Paul McIlroy, Edward Rosten, Simon Taylor, Tom Dru...