175 search results - page 17 / 35 » max-cut and Containment Relations in Graphs |
LCPC
2005
Springer
14 years 2 months ago
2005
Springer
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
ESWS
2010
Springer
14 years 1 months ago
2010
Springer
While the Semantic Web is rapidly filling up, appropriate tools for searching it are still at infancy. In this paper we describe an approach that allows humans to access informatio...
DILS
2006
Springer
14 years 8 days ago
2006
Springer
Public biological databases contain vast amounts of rich data that can also be used to create and evaluate new biological hypothesis. We propose a method for link discovery in biol...
JGT
2007
13 years 8 months ago
2007
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
This work addresses the use of computational linguistic analysis techniques for conceptual graphs learning from unstructured texts. A technique including both content mining and i...