3875 search results - page 434 / 775 » Approximation algorithms for the 0-extension problem |
177
click to vote
MICAI
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
202
Voted
JAIR
2010
15 years 5 months ago
2010
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
208
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
188
click to vote
EACL
2009
ACL Anthology
16 years 7 months ago
2009
ACL Anthology
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
296
click to vote
VLDB
2006
ACM
16 years 7 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...