15073 search results - page 188 / 3015 » Probabilistic algorithms for computing resultants |
146
click to vote
UAI
2001
15 years 7 months ago
2001
In previous work [8] we presented a casebased approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user prefe...
164
click to vote
APIN
1999
15 years 6 months ago
1999
We present a method for mapping a given Bayesian network to a Boltzmann machine architecture, in the sense that the the updating process of the resulting Boltzmann machine model pr...
211
click to vote
OR
2007
Springer
15 years 6 months ago
2007
Springer
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...
170
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Detecting image pairs with a common field of view is
an important prerequisite for many computer vision tasks.
Typically, common local features are used as a criterion
for ident...
155
click to vote
FOSSACS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...