Sciweavers

395 search results - page 44 / 79
» Positive Versions of Polynomial Time
Sort
View
NIPS
2007
14 years 11 months ago
Rapid Inference on a Novel AND/OR graph for Object Detection, Segmentation and Parsing
In this paper we formulate a novel AND/OR graph representation capable of describing the different configurations of deformable articulated objects such as horses. The representa...
Yuanhao Chen, Long Zhu, Chenxi Lin, Alan L. Yuille...
CATS
2006
14 years 11 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
AAAI
1996
14 years 11 months ago
Learning to Take Actions
We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. W...
Roni Khardon
CORR
2004
Springer
85views Education» more  CORR 2004»
14 years 9 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
IWPEC
2010
Springer
14 years 7 months ago
Multivariate Complexity Analysis of Swap Bribery
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
Britta Dorn, Ildikó Schlotter