Sciweavers

4926 search results - page 425 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ICDM
2008
IEEE
108views Data Mining» more  ICDM 2008»
15 years 10 months ago
Non-negative Matrix Factorization on Manifold
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...
Deng Cai, Xiaofei He, Xiaoyun Wu, Jiawei Han
TAMC
2010
Springer
15 years 9 months ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
15 years 8 months ago
High-Throughput 3D Structural Homology Detection via NMR Resonance Assignment
One goal of the structural genomics initiative is the identification of new protein folds. Sequence-based structural homology prediction methods are an important means for priorit...
Christopher James Langmead, Bruce Randall Donald
IPTPS
2004
Springer
15 years 9 months ago
DHT Routing Using Social Links
— The equality and anonymity of peer-to-peer networks makes them vulnerable to routing denial of service attacks from misbehaving nodes. In this paper, we investigate how existin...
Sergio Marti, Prasanna Ganesan, Hector Garcia-Moli...
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 2 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...