Sciweavers

2651 search results - page 200 / 531
» Experiences with the Use of a Configuration Language
Sort
View
ICGI
2010
Springer
15 years 4 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
EMNLP
2009
15 years 4 months ago
Multi-Word Expression Identification Using Sentence Surface Features
Much NLP research on Multi-Word Expressions (MWEs) focuses on the discovery of new expressions, as opposed to the identification in texts of known expressions. However, MWE identi...
Ram Boukobza, Ari Rappoport
JMLR
2012
13 years 9 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
INLG
2004
Springer
16 years 4 days ago
Generating Referring Expressions Using Perceptual Groups
Past work of generating referring expressions mainly utilized attributes of objects and binary relations between objects to distinguish the referent from other objects. However, su...
Kotaro Funakoshi, Satoru Watanabe, Naoko Kuriyama,...
FM
2008
Springer
137views Formal Methods» more  FM 2008»
15 years 8 months ago
JML Runtime Assertion Checking: Improved Error Reporting and Efficiency Using Strong Validity
Abstract. The Java Modeling Language (JML) recently switched to an assertion semantics based on "strong validity" in which an assertion is taken to be valid precisely whe...
Patrice Chalin, Frédéric Rioux