194 search results - page 21 / 39 » Randomness for Free |
PE
2007
Springer
13 years 8 months ago
2007
Springer
The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference betwee...
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
FSTTCS
1995
Springer
13 years 12 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
EPEW
2008
Springer
13 years 10 months ago
2008
Springer
The problem of finding trust paths and estimating the trust one can place in a partner arises in various application areas, including virtual organisations, authentication systems ...
EUROPAR
2009
Springer
14 years 3 months ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....