Sciweavers

1224 search results - page 229 / 245
» Theory decision by decomposition
Sort
View
CVPR
2010
IEEE
14 years 7 months ago
Scalable Active Matching
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
Ankur Handa, Margarita Chli, Hauke Strasdat, Andre...
FOCS
2009
IEEE
14 years 5 months ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...
WOLLIC
2009
Springer
14 years 5 months ago
Classic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
Carlos Caleiro, João Marcos
ATAL
2009
Springer
14 years 5 months ago
Decentralised coordination of continuously valued control parameters using the max-sum algorithm
In this paper we address the problem of decentralised coordination for agents that must make coordinated decisions over continuously valued control parameters (as is required in m...
Ruben Stranders, Alessandro Farinelli, Alex Rogers...
ATAL
2009
Springer
14 years 5 months ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
James Pita, Manish Jain, Fernando Ordó&ntil...