4009 search results - page 602 / 802 » Clustering on Complex Graphs |
171
click to vote
MFCS
2005
Springer
16 years 18 hour 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...
201
click to vote
PREMI
2005
Springer
16 years 12 hour 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...
195
click to vote
VMCAI
2005
Springer
16 years 5 hour 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...
159
click to vote
WDAG
2005
Springer
16 years 4 hour 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 ...
167
click to vote
DIALM
2004
ACM
15 years 12 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...