607 search results - page 49 / 122 » Unifying Exact Completions |
121
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
104
click to vote
COLT
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...
89
Voted
CADE
1998
Springer
15 years 4 months ago
1998
Springer
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
77
Voted
ECIS
2001
15 years 2 months ago
2001
There are many data modelling languages used in today's information systems engineering environment. Some of the data modelling languages used have a degree of hype surroundi...
80
Voted
EJC
2010
15 years 20 days ago
2010
We start by describing all the varieties of loops Q that can be defined by autotopisms x, x Q, where x is a composition of two triples, each of which becomes an autotopism when th...