Sciweavers

157 search results - page 25 / 32
» On Bayesian bounds
Sort
View
PAMI
2008
235views more  PAMI 2008»
13 years 9 months ago
Dependent Multiple Cue Integration for Robust Tracking
We propose a new technique for fusing multiple cues to robustly segment an object from its background in video sequences that suffer from abrupt changes of both illumination and po...
Francesc Moreno-Noguer, Alberto Sanfeliu, Dimitris...
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
14 years 9 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
IAT
2008
IEEE
14 years 4 months ago
Finding Minimum Data Requirements Using Pseudo-independence
In situations where Bayesian networks (BN) inferencing approximation is allowable, we show how to reduce the amount of sensory observations necessary and in a multi-agent context ...
Yoonheui Kim, Victor R. Lesser
MP
2006
110views more  MP 2006»
13 years 9 months ago
Robust game theory
We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...
Michele Aghassi, Dimitris Bertsimas
TIT
2011
119views more  TIT 2011»
13 years 4 months ago
Minimax Robust Quickest Change Detection
—The popular criteria of optimality for quickest change detection procedures are the Lorden criterion, the Pollak criterion, and the Bayesian criterion. In this paper, a robust v...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli...