Sciweavers

3204 search results - page 211 / 641
» The Alcuin Number of a Graph
Sort
View
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 6 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
186
Voted
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
16 years 3 months ago
Near-optimal Supervised Feature Selection among Frequent Subgraphs.
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
Alexander J. Smola, Arthur Gretton, Hans-Peter Kri...
FOCS
2006
IEEE
16 years 4 days ago
Lower Bounds for Additive Spanners, Emulators, and More
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
David P. Woodruff
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
15 years 5 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
EDBT
2012
ACM
257views Database» more  EDBT 2012»
13 years 8 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh