Sciweavers

112 search results - page 19 / 23
» Neighborhood based fast graph search in large networks
Sort
View
80
Voted
ECAI
2008
Springer
14 years 11 months ago
Modeling Collaborative Similarity with the Signed Resistance Distance Kernel
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...
Jérôme Kunegis, Stephan Schmidt, Sahi...
FCCM
2004
IEEE
141views VLSI» more  FCCM 2004»
15 years 1 months ago
Deep Packet Filter with Dedicated Logic and Read Only Memories
Searching for multiple string patterns in a stream of data is a computationally expensive task. The speed of the search pattern module determines the overall performance of deep p...
Young H. Cho, William H. Mangione-Smith
TKDE
2008
134views more  TKDE 2008»
14 years 9 months ago
Contraflow Transportation Network Reconfiguration for Evacuation Route Planning
Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...
Sangho Kim, Shashi Shekhar, Manki Min
94
Voted
BMCBI
2006
101views more  BMCBI 2006»
14 years 9 months ago
SynTReN: a generator of synthetic gene expression data for design and analysis of structure learning algorithms
Background: The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validatio...
Tim Van den Bulcke, Koen Van Leemput, Bart Naudts,...
82
Voted
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
15 years 10 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang