9842 search results - page 183 / 1969 » The Complexity of the Matching-Cut Problem |
110
Voted
AAAI
2010
15 years 2 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
80
Voted
COLING
2008
15 years 2 months ago
2008
This work presents the development of a system that detects incorrect uses of complex postpositions in Basque, an agglutinative language. Error detection in complex postpositions ...
119
Voted
AAAI
2006
15 years 2 months ago
2006
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
BMCBI
2007
15 years 19 days ago
2007
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
110
Voted
CORR
2010
Springer
15 years 22 days ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...