1088 search results - page 1 / 218 » Independence of Negative Constraints |
TAPSOFT
1989
Springer
13 years 9 months ago
1989
Springer
In the 1820's Fourier provided the first algorithm for solving linear arithmetic constraints. In other words, this algorithm determines whether or not the polyhedral set asso...
WWW
2008
ACM
14 years 7 months ago
2008
ACM
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
CVPR
2010
IEEE
13 years 11 months ago
2010
IEEE
Non-negative matrix factorization (NMF) is an excellent tool for unsupervised parts-based learning, but proves to be ineffective when parts of a whole follow a specific pattern. ...
ACL
1997
13 years 7 months ago
1997
We identify and validate from a large corpus constraints from conjunctions on the positive or negative semantic orientation of the conjoined adjectives. A log-linear regression mo...
PADL
2000
Springer
13 years 10 months ago
2000
Springer
Constraint combination methods are essential for a flexible constraint programming system. This paper presents deep concurrent constraint combinators based on computation spaces as...