Sciweavers

3708 search results - page 34 / 742
» Approximating Betweenness Centrality
Sort
View
PAMI
2010
103views more  PAMI 2010»
13 years 9 months ago
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
Amin Mantrach, Luh Yen, Jérôme Callut...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 11 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...
BMCBI
2010
148views more  BMCBI 2010»
13 years 11 months ago
Analysis of interactions between ribosomal proteins and RNA structural motifs
Background: One important goal of structural bioinformatics is to recognize and predict the interactions between protein binding sites and RNA. Recently, a comprehensive analysis ...
Giovanni Ciriello, Claudio Gallina, Concettina Gue...
SIGMOD
2011
ACM
205views Database» more  SIGMOD 2011»
13 years 1 months ago
Interaction between record matching and data repairing
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Weny...
DCOSS
2006
Springer
14 years 2 months ago
Contour Approximation in Sensor Networks
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
Chiranjeeb Buragohain, Sorabh Gandhi, John Hershbe...