Sciweavers

13603 search results - page 89 / 2721
» On the Complexity of Computing Treelength
Sort
View
LATINCRYPT
2010
13 years 7 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
ESAW
2009
Springer
13 years 7 months ago
Thinking Integral: How to Build Complex Systems That Live with People and Exhibit Collective Intelligence
009), which constitutes an abstraction of the various aspects of a MAS, generalizing the AGR approach and incorporating the institutional work of Searle (Searle 1995). This model i...
Jacques Ferber
CPHYSICS
2011
267views Education» more  CPHYSICS 2011»
13 years 22 days ago
Fast alignment of a complex tracking detector using advanced track models
The inner silicon detector of the Compact Muon Solenoid experiment (CMS) at CERN’s LHC consists of 16 588 modules. Charged-particle tracks in the detector are used to improve th...
Volker Blobel, Claus Kleinwort, Frank Meier
NAR
2011
252views Computer Vision» more  NAR 2011»
13 years 1 days ago
BISC: Binary SubComplexes in proteins database
Binary subcomplexes in proteins database (BISC) is a new protein–protein interaction (PPI) database linking up the two communities most active in their characterization: structu...
Thomas Juettemann, Dietlind L. Gerloff
FGCS
2002
133views more  FGCS 2002»
13 years 9 months ago
Computational and data Grids in large-scale science and engineering
As the practice of science moves beyond the single investigator due to the complexity of the problems that now dominate science, large collaborative and multi-institutional teams ...
William E. Johnston