Sciweavers

10608 search results - page 247 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
15 years 7 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
BMCBI
2010
150views more  BMCBI 2010»
15 years 18 days ago
MCL-CAw: a refinement of MCL for detecting yeast complexes from weighted PPI networks by incorporating core-attachment structure
Background: The reconstruction of protein complexes from the physical interactome of organisms serves as a building block towards understanding the higher level organization of th...
Sriganesh Srihari, Kang Ning, Hon Wai Leong
BMCBI
2008
175views more  BMCBI 2008»
15 years 18 days ago
Comprehensive inventory of protein complexes in the Protein Data Bank from consistent classification of interfaces
Background: Protein-protein interactions are ubiquitous and essential for all cellular processes. High-resolution X-ray crystallographic structures of protein complexes can reveal...
Andrew J. Bordner, Andrey A. Gorin
IJAR
2007
96views more  IJAR 2007»
15 years 12 days ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang
116
Voted
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 5 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun