Sciweavers

243 search results - page 48 / 49
» Empirical comparison of algorithms for network community det...
Sort
View
GECCO
2007
Springer
268views Optimization» more  GECCO 2007»
13 years 10 months ago
Vulnerability analysis and security framework (BeeSec) for nature inspired MANET routing protocols
Design, development and evaluation of adaptive, scalable, and power aware Bio/Nature inspired routing protocols has received a significant amount of attention in the recent past....
Nauman Mazhar, Muddassar Farooq
ETVC
2008
13 years 6 months ago
Abstracts of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing
s of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing Frank Nielsen Ecole Polytechnique, Palaiseau, France Sony CSL, Tokyo, Japan Abstract. We list the abstracts o...
Frank Nielsen
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
13 years 9 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
BMCBI
2008
129views more  BMCBI 2008»
13 years 4 months ago
A unified approach to false discovery rate estimation
Background: False discovery rate (FDR) methods play an important role in analyzing highdimensional data. There are two types of FDR, tail area-based FDR and local FDR, as well as ...
Korbinian Strimmer
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 4 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...