Sciweavers

1578 search results - page 113 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
BMCBI
2008
175views more  BMCBI 2008»
13 years 9 months 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
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 2 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
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
14 years 3 months ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...
ICRA
2003
IEEE
144views Robotics» more  ICRA 2003»
14 years 2 months ago
Error-tolerant execution of complex robot tasks based on skill primitives
— This paper presents a general approach to specify and execute complex robot tasks considering uncertain environments. Robot tasks are defined by a precise definition of socal...
Ulrike Thomas, Bernd Finkemeyer, Torsten Krög...
LICS
1994
IEEE
14 years 29 days ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka