Sciweavers

1172 search results - page 140 / 235
» Path Algorithms on Regular Graphs
Sort
View
118
Voted
BMCBI
2010
148views more  BMCBI 2010»
15 years 2 months ago
Structuring heterogeneous biological information using fuzzy clustering of k-partite graphs
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
Mara L. Hartsperger, Florian Blöchl, Volker S...
109
Voted
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
16 years 2 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
128
Voted
SDM
2009
SIAM
331views Data Mining» more  SDM 2009»
15 years 11 months ago
Privacy Preservation in Social Networks with Sensitive Edge Weights.
With the development of emerging social networks, such as Facebook and MySpace, security and privacy threats arising from social network analysis bring a risk of disclosure of con...
Jie Wang, Jinze Liu, Jun Zhang, Lian Liu
106
Voted
TIT
2008
102views more  TIT 2008»
15 years 2 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
157
Voted
IJON
2010
178views more  IJON 2010»
15 years 1 months ago
An empirical study of two typical locality preserving linear discriminant analysis methods
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
Lishan Qiao, Limei Zhang, Songcan Chen