Sciweavers

776 search results - page 82 / 156
» Network Applications of Graph Bisimulation
Sort
View
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
14 years 3 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
IPSN
2007
Springer
14 years 4 months ago
NIST smart data flow system II: speaker localization
Multimodal applications require the acquisition and processing of massive amounts of information from multiple sensors. Because this process is beyond the capabilities of a single...
Antoine Fillinger, Lukas Diduch, Imad Hamchi, St&e...
ORL
2006
103views more  ORL 2006»
13 years 10 months ago
Reduction tests for the prize-collecting Steiner problem
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
Eduardo Uchoa
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 8 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 10 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...