Sciweavers

2314 search results - page 253 / 463
» Monoids over domains
Sort
View
ML
2012
ACM
413views Machine Learning» more  ML 2012»
14 years 2 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...
CVPR
2007
IEEE
16 years 8 months ago
Improved Video Registration using Non-Distinctive Local Image Features
The task of registering video frames with a static model is a common problem in many computer vision domains. The standard approach to registration involves finding point correspo...
Robin Hess, Alan Fern
DAC
2002
ACM
16 years 7 months ago
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
Malay K. Ganai, Pranav Ashar, Aarti Gupta, Lintao ...
ERCIMDL
2009
Springer
225views Education» more  ERCIMDL 2009»
16 years 1 months ago
Demonstration of User Interfaces for Querying in 3D Architectural Content in PROBADO3D
Abstract. The PROBADO project is a research effort to develop Digital Library support for non-textual documents. The main goal is to contribute to all parts of the Digital Library...
René Bernd, Ina Blümel, Harald Krottma...
ATAL
2007
Springer
16 years 24 days ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe