128 search results - page 16 / 26 » Evidence and Belief |
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
We propose Markov random fields (MRFs) as a probabilistic mathematical model for unifying approaches to multi-robot coordination or, more specifically, distributed action selectio...
82
Voted
SIGIR
2000
ACM
15 years 1 months ago
2000
ACM
: This paper presents a novel way of examining the accuracy of the evaluation measures commonly used in information retrieval experiments. It validates several of the rules-of-thum...
104
Voted
WINE
2005
Springer
15 years 2 months ago
2005
Springer
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related...
ECCC
2000
14 years 9 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
115
click to vote
ECCV
2008
Springer
15 years 7 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...