4865 search results - page 736 / 973 » The Complexity of Graph Connectivity |
135
click to vote
MFCS
2005
Springer
15 years 10 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...
156
click to vote
PREMI
2005
Springer
15 years 10 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...
156
click to vote
VMCAI
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
134
click to vote
WDAG
2005
Springer
15 years 10 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 ...
120
click to vote
ISPD
2004
ACM
15 years 10 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...