1952 search results - page 220 / 391 » Complete partitions of graphs |
154
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
154
click to vote
ICDAR
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
192
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
169
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...
164
click to vote
ITS
2000
Springer
15 years 10 months ago
2000
Springer
We developed a distributed support model in an interface for distant learning. The support is integrated into the ExploraGraph navigator which makes it possible to navigate through...