AbnerCYH profile

Recent Activity

• 05:28: Posted Classes of complex networks defined by role-to-role connectivity profiles
• 05:28: Posted Evolvability and hierarchy in rewired bacterial gene networks

• 02:40: Posted Natural Proofs,
• 02:40: Posted A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting,

• 06:50: Posted Complex networks: Lies, damned lies and statistics
• 06:24: Posted Complex networks: Role model for modules

• 05:16: Posted Singular Value Decomposition and Principal Component Analysis

• 08:08: Posted Constructing boosting algorithms from SVMs: an application toone-class classification

• 21:39: Posted The support vector machine under test
• 20:56: Posted The boosting approach to machine learning: An overview
• 13:15: Posted Protein Structure from Contact Maps: A Case-Based Reasoning Approach
• 13:02: Posted An introduction to ROC analysis
• 13:02: Posted Using AUC and accuracy in evaluating learning algorithms
• 12:47: Posted Analyzing Receiver Operating Characteristic Curves With SAS (Sas Press Series) (Sas Press Series)
• 09:22: Posted The use of receiver operating characteristic curves in biomedical informatics

• 19:53: Posted Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology
• 19:24: Posted Separators for sphere-packings and nearest neighbor graphs
• 18:56: Posted Protein side-chain packing problem: a maximum edge-weight clique algorithmic approach
• 18:56: Posted Fast and accurate algorithms for protein side-chain packing
• 07:55: Posted Recognizing the fold of a protein structure

• 10:20: Posted The combinatorial encoding of disjoint convex sets in the plane
• 10:20: Posted Properties of intersecting families of ordered sets

• 04:28: Posted Partitioned probe comparability graphs

• 16:51: Posted Survey of graph database models
• 16:05: Posted Information measures, effective complexity, and total information
• 15:58: Posted Width Parameters Beyond Tree-width and their Applications
• 15:57: Posted Parameterized Complexity of Geometric Problems
• 15:42: Posted Combinatorial Optimization on Graphs of Bounded Treewidth
• 08:41: Posted Hierarchical structure and the prediction of missing links in networks

• 17:27: Posted Sorting Jordan sequences in linear time
• 17:23: Posted Sorting Jordan sequences in linear time using level-linked search trees

• 06:09: Posted A Short Algebraic Proof of the Farkas Lemma
• 02:25: Posted Understanding and Using Linear Programming (Universitext)
• 01:57: Posted Finding frequent patterns in a large sparse graph

• 10:39: Posted Mining the Web: Analysis of Hypertext and Semi Structured Data
• 10:08: Posted Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
• 06:10: Posted Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)

• 19:12: Posted Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
• 19:11: Posted Statistical Learning Theory
• 15:41: Posted Summarization Graph Indexing: Beyond Frequent Structure-Based Approach

• 14:17: Posted Topological Methods in Combinatorics and Geometry