1366 search results - page 94 / 274 » Modularizing Contexted Constraints |
86
Voted
WWW
2008
ACM
15 years 12 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...
105
click to vote
NIPS
1990
15 years 13 days ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
IS
2010
14 years 9 months ago
2010
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
FOIKS
2010
Springer
15 years 2 months ago
2010
Springer
Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set from a fixed constraint class Z satisfies precisely those ...
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We introduce the first substantial approach to preprocessing in the context of answer set solving. The idea is to simplify a logic program while identifying equivalences ...