3875 search results - page 377 / 775 » Approximation algorithms for the 0-extension problem |
191
click to vote
UAI
2001
15 years 8 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
175
click to vote
JC
1998
15 years 6 months ago
1998
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...
178
click to vote
Publication
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
216
click to vote
AAMAS
2011
Springer
15 years 1 months ago
2011
Springer
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
212
click to vote
CEC
2011
IEEE
14 years 6 months ago
2011
IEEE
—Despite the range of applications and successes of evolutionary algorithms, expensive fitness computations often form a critical performance bottleneck. A preferred method of r...