Sciweavers

12 search results - page 1 / 3
» K-shell decomposition for dynamic complex networks
Sort
View
WIOPT
2010
IEEE
13 years 3 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
CP
2006
Springer
13 years 8 months ago
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
RECOMB
2005
Springer
14 years 5 months ago
Decomposition of Overlapping Protein Complexes: A Graph Theoretical Method for Analyzing Static and Dynamic Protein Associations
Background: Most cellular processes are carried out by multi-protein complexes, groups of proteins that bind together to perform a specific task. Some proteins form stable complex...
Elena Zotenko, Katia S. Guimarães, Raja Jot...
CEC
2010
IEEE
12 years 12 months ago
Parameter estimation with term-wise decomposition in biochemical network GMA models by hybrid regularized Least Squares-Particle
High-throughput analytical techniques such as nuclear magnetic resonance, protein kinase phosphorylation, and mass spectroscopic methods generate time dense profiles of metabolites...
Prospero C. Naval, Luis G. Sison, Eduardo R. Mendo...
PR
2011
12 years 7 months ago
Detecting and discriminating behavioural anomalies
This paper aims to address the problem of anomaly detection and discrimination in complex behaviours, where anomalies are subtle and difficult to detect owing to the complex tempo...
Chen Change Loy, Tao Xiang, Shaogang Gong