Sciweavers

54 search results - page 5 / 11
» Forcing highly connected subgraphs
Sort
View
BMCBI
2010
101views more  BMCBI 2010»
14 years 9 months ago
Comparative analysis of thermophilic and mesophilic proteins using Protein Energy Networks
Background: Thermophilic proteins sustain themselves and function at higher temperatures. Despite their structural and functional similarities with their mesophilic homologues, th...
M. S. Vijayabaskar, Saraswathi Vishveshwara
ESANN
2003
14 years 10 months ago
High-dimensional labeled data analysis with Gabriel graphs
We propose the use of the Gabriel graph for the exploratory analysis of potentially high dimensional labeled data. Gabriel graph is a subgraph of the Delaunay triangulation, which ...
Michaël Aupetit
SIGCOMM
2006
ACM
15 years 3 months ago
Detecting evasion attacks at high speeds without reassembly
Ptacek and Newsham [14] showed how to evade signature detection at Intrusion Prevention Systems (IPS) using TCP and IP Fragmentation. These attacks are implemented in tools like F...
George Varghese, J. Andrew Fingerhut, Flavio Bonom...
CIDM
2009
IEEE
15 years 1 months ago
Empirical comparison of graph classification algorithms
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
BMCBI
2011
14 years 1 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto