2125 search results - page 293 / 425 » On Graph Complexity |
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
92
Voted
PREMI
2005
Springer
15 years 3 months ago
2005
Springer
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Template...
WDAG
2005
Springer
15 years 3 months ago
2005
Springer
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
BVAI
2005
Springer
15 years 3 months ago
2005
Springer
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
ISPD
2004
ACM
15 years 3 months ago
2004
ACM
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...