232 search results - page 6 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
GD
2004
Springer
14 years 2 days ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
ISAAC
2004
Springer
14 years 2 days ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
IJCV
2007
13 years 6 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
AUSAI
2006
Springer
13 years 10 months ago
2006
Springer
Establishing relationships within a dataset is one of the core objectives of data mining. In this paper a method of correlating behaviour profiles in a continuous dataset is presen...