Sciweavers

189 search results - page 7 / 38
» Efficient Representation of Adhoc Constraints
Sort
View
AAAI
1996
13 years 11 months ago
Agent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...
Peggy S. Eaton, Eugene C. Freuder
CVPR
2004
IEEE
14 years 11 months ago
Representation and Matching of Articulated Shapes
We consider the problem of localizing the articulated and deformable shape of a walking person in a single view. We represent the non-rigid 2D body contour by a Bayesian graphical...
Jiayong Zhang, Robert T. Collins, Yanxi Liu
UAI
2001
13 years 11 months ago
UCP-Networks: A Directed Graphical Representation of Conditional Utilities
We propose a directed graphical representation of utility functions, called UCP-networks, that combines aspects of two existing preference models: generalized additive models and ...
Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman
ICCV
2009
IEEE
15 years 2 months ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs
ENTCS
2008
85views more  ENTCS 2008»
13 years 9 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset