Sciweavers

779 search results - page 12 / 156
» Ranking distributed probabilistic data
Sort
View
ERCIMDL
2007
Springer
87views Education» more  ERCIMDL 2007»
14 years 3 months ago
A Model of Uncertainty for Near-Duplicates in Document Reference Networks
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
Claudia Hess, Michel de Rougemont
ICRA
2007
IEEE
129views Robotics» more  ICRA 2007»
14 years 4 months ago
Robust Distributed Coverage using a Swarm of Miniature Robots
Abstract— For the multi-robot coverage problem deterministic deliberative as well as probabilistic approaches have been proposed. Whereas deterministic approaches usually provide...
Nikolaus Correll, Alcherio Martinoli
MLCW
2005
Springer
14 years 3 months ago
Lessons Learned in the Challenge: Making Predictions and Scoring Them
In this paper we present lessons learned in the Evaluating Predictive Uncertainty Challenge. We describe the methods we used in regression challenges, including our winning method ...
Jukka Kohonen, Jukka Suomela
ALT
2008
Springer
14 years 6 months ago
Smooth Boosting for Margin-Based Ranking
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masa...
EOR
2010
84views more  EOR 2010»
13 years 9 months ago
The selection efficiency of tournaments
We discuss tournaments in terms of their efficiency as probabilistic mechanisms that select high-quality alternatives ("players") in a noisy environment. We use two crit...
Dmitry Ryvkin