Sciweavers

259 search results - page 9 / 52
» Graph Distances in the Data-Stream Model
Sort
View
IPPS
2009
IEEE
14 years 3 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
STACS
2007
Springer
14 years 2 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler
JWSR
2007
114views more  JWSR 2007»
13 years 8 months ago
Development of Distance Measures for Process Mining, Discovery and Integration
: Business processes continue to play an important role in today’s service-oriented enterprise computing systems. Mining, discovering, and integrating process-oriented services h...
Joonsoo Bae, Ling Liu, James Caverlee, Liang-Jie Z...
ICALP
2001
Springer
14 years 24 days ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...
ECEASST
2008
91views more  ECEASST 2008»
13 years 8 months ago
Graph Transformation Model of a Triangulated Network of Mobile Units
Abstract: A triangulated network of mobile units is modelled by means of a graph transformation system in which graph nodes are labelled with geometric coordinates and edges are la...
Stefan Gruner