2609 search results - page 235 / 522 » Models for Global Constraint Applications |
194
click to vote
EMNLP
2006
15 years 8 months ago
2006
Semantic lexical matching is a prominent subtask within text understanding applications. Yet, it is rarely evaluated in a direct manner. This paper proposes a definition for lexic...
180
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
144
click to vote
VLDB
2004
ACM
15 years 12 months ago
2004
ACM
The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containin...
189
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we consider the process algebra ACPL, which models the basics of agent communication. This algebra combines the informationprocessing aspects of Concurrent...
197
click to vote
JSAC
2007
15 years 6 months ago
2007
— In WDM optical networks connection requests can be classified into three different types: Permanent Lightpath Demands (PLDs), Scheduled Lightpath Demands (SLDs), and Random Li...