Sciweavers

16666 search results - page 49 / 3334
» Descriptive and Computational Complexity
Sort
View
97
Voted
ORL
2010
76views more  ORL 2010»
15 years 1 months ago
Small bipartite subgraph polytopes
We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these ...
Laura Galli, Adam N. Letchford
98
Voted
SOFSEM
2010
Springer
16 years 12 days ago
Comparison of Scoring and Order Approach in Description Logic EL(D)
Veronika Vaneková, Peter Vojtás
87
Voted
SAC
2006
ACM
15 years 9 months ago
An evaluation of resource description quality measures
Mark Baillie, Leif Azzopardi, Fabio Crestani