Sciweavers

1510 search results - page 89 / 302
» Upper Probabilities and Additivity
Sort
View
TOMACS
2002
101views more  TOMACS 2002»
14 years 9 months ago
Efficient simulation of a tandem Jackson network
In this paper we consider a two-node tandem Jackson network. Starting from a given state, we are interested in estimating the probability that the content of the second buffer exc...
Dirk P. Kroese, Victor F. Nicola
CMOT
2010
203views more  CMOT 2010»
14 years 7 months ago
A Bayesian approach to modeling lost person behaviors based on terrain features in Wilderness Search and Rescue
: In Wilderness Search and Rescue (WiSAR), the incident commander (IC) creates a probability distribution map of the likely location of the missing person. This map is important be...
Lanny Lin, Michael A. Goodrich
ICPR
2006
IEEE
15 years 11 months ago
Hybrid Off-Line Cursive Handwriting Word Recognition
In this paper, we present an off-line cursive word handwriting recognition methodology. This is based on an additive fusion resulted after a novel combination of two different mod...
Basilios Gatos, Ioannis Pratikakis, Stavros J. Per...
ICML
1999
IEEE
15 years 10 months ago
AdaCost: Misclassification Cost-Sensitive Boosting
AdaCost, a variant of AdaBoost, is a misclassification cost-sensitive boosting method. It uses the cost of misclassifications to update the training distribution on successive boo...
Wei Fan, Salvatore J. Stolfo, Junxin Zhang, Philip...
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
15 years 4 months ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem