Sciweavers

4781 search results - page 139 / 957
» Complexity at large
Sort
View
CVPR
2012
IEEE
12 years 20 days ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori
BMCBI
2010
142views more  BMCBI 2010»
13 years 10 months ago
Discover Protein Complexes in Protein-Protein Interaction Networks Using Parametric Local Modularity
Background: Recent advances in proteomic technologies have enabled us to create detailed protein-protein interaction maps in multiple species and in both normal and diseased cells...
Jongkwang Kim, Kai Tan
BMCBI
2008
131views more  BMCBI 2008»
13 years 10 months ago
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
Background: Identification of protein complexes is crucial for understanding principles of cellular organization and functions. As the size of protein-protein interaction set incr...
Min Li, Jianer Chen, Jianxin Wang, Bin Hu, Gang Ch...
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 4 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
BMCBI
2008
93views more  BMCBI 2008»
13 years 10 months ago
Homology modelling of protein-protein complexes: a simple method and its possibilities and limitations
Background: Structure-based computational methods are needed to help identify and characterize protein-protein complexes and their function. For individual proteins, the most succ...
Guillaume Launay, Thomas Simonson