Sciweavers

65 search results - page 5 / 13
» Belief function independence: II. The conditional case
Sort
View
CVPR
2009
IEEE
15 years 3 months ago
Epitomized Priors for Multi-labeling Problems
Image parsing remains difficult due to the need to combine local and contextual information when labeling a scene. We approach this problem by using the epitome as a prior over ...
Jonathan Warrell, Simon J. D. Prince, Alastair P. ...
GECCO
2003
Springer
103views Optimization» more  GECCO 2003»
14 years 1 months ago
Are Multiple Runs of Genetic Algorithms Better than One?
Abstract. There are conflicting reports over whether multiple independent runs of genetic algorithms (GAs) with small populations can reach solutions of higher quality or can fin...
Erick Cantú-Paz, David E. Goldberg
CORR
2011
Springer
191views Education» more  CORR 2011»
13 years 3 months ago
Picturing classical and quantum Bayesian inference
We introduce a graphical framework for Bayesian inference that is sufficiently general to accommodate not just the standard case but also recent proposals for a theory of quantum...
Bob Coecke, Robert W. Spekkens
IJCAI
2007
13 years 10 months ago
Vote and Aggregation in Combinatorial Domains with Structured Preferences
In many real-world collective decision problems, the set of alternatives is a Cartesian product of finite value domains for each of a given set of variables. The prohibitive size...
Jérôme Lang
TIT
2010
138views Education» more  TIT 2010»
13 years 3 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...