999 search results - page 57 / 200 » Constraints in Non-Boolean Contexts |
160
click to vote
LREC
2010
15 years 7 months ago
2010
This paper describes a hybrid tagger/parser for French (FrAG), and presents results from ongoing development work, corpus annotation and evaluation. The core of the system is a se...
159
click to vote
WWW
2008
ACM
16 years 6 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...
181
click to vote
NIPS
1990
15 years 7 months 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...
148
click to vote
FOIKS
2010
Springer
15 years 9 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 ...
167
click to vote
ECAI
2008
Springer
15 years 8 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 ...