949 search results - page 88 / 190 » Theory of Constraints |
111
click to vote
PODS
1997
ACM
15 years 4 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
KDD
2003
ACM
16 years 1 months ago
2003
ACM
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
SEMWEB
2007
Springer
15 years 6 months ago
2007
Springer
Ontology mapping is to find semantic correspondences between similar elements of different ontologies. It is critical to achieve semantic interoperability in the WWW. This paper pr...
101
click to vote
LPNMR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
EMNLP
2008
15 years 2 months ago
2008
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...