Sciweavers

6413 search results - page 535 / 1283
» Classes of cycle bases
Sort
View
ICECCS
1997
IEEE
102views Hardware» more  ICECCS 1997»
15 years 11 months ago
Problem complexity
An approach to problem analysis is described, based on the notion of a problem frame. Problem frames are intended to capture classes of recognisable and soluble problems. Because ...
Michael Jackson
CSL
1994
Springer
15 years 11 months ago
Resolution Games and Non-Liftable Resolution Orderings
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
Hans de Nivelle
CADE
2008
Springer
15 years 9 months ago
Automated Implicit Computational Complexity Analysis (System Description)
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
Martin Avanzini, Georg Moser, Andreas Schnabl
APVIS
2006
15 years 8 months ago
Method for drawing intersecting clustered graphs and its application to web ontology language
We introduce a class of graphs called an intersecting clustered graph that is a clustered graph with intersections among clusters. We propose a novel method for nicely drawing the...
Hiroki Omote, Kozo Sugiyama
EACL
2003
ACL Anthology
15 years 8 months ago
Combining Distributional and Morphological Information for Part of Speech Induction
In this paper we discuss algorithms for clustering words into classes from unlabelled text using unsupervised algorithms, based on distributional and morphological information. We...
Alexander Clark