Sciweavers

329 search results - page 46 / 66
» A Graph Theoretic Approach to Protein Structure Selection
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 11 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
ACMSE
2006
ACM
14 years 2 months ago
Discovering communities in complex networks
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
Hemant Balakrishnan, Narsingh Deo
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 8 months ago
Stochastic Games for Security in Networks with Interdependent Nodes
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take pa...
Kien C. Nguyen, Tansu Alpcan, Tamer Basar
WWW
2007
ACM
14 years 9 months ago
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
FLAIRS
2001
13 years 10 months ago
Improvement of Nearest-Neighbor Classifiers via Support Vector Machines
Theoretically well-founded, Support Vector Machines (SVM)are well-knownto be suited for efficiently solving classification problems. Althoughimprovedgeneralization is the maingoal...
Marc Sebban, Richard Nock