Sciweavers

4539 search results - page 216 / 908
» Approaches to Compute Workflow Complexity
Sort
View
149
Voted
BMCBI
2007
145views more  BMCBI 2007»
15 years 4 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
EUROCRYPT
2000
Springer
15 years 8 months ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
ASPLOS
2011
ACM
14 years 8 months ago
RCDC: a relaxed consistency deterministic computer
Providing deterministic execution significantly simplifies the debugging, testing, replication, and deployment of multithreaded programs. Recent work has developed deterministic...
Joseph Devietti, Jacob Nelson, Tom Bergan, Luis Ce...
ER
1999
Springer
196views Database» more  ER 1999»
15 years 8 months ago
A Process-Integrated Conceptual Design Environment for Chemical Engineering
Abstract. The process industries (chemicals, food, oil, ...) are characterized by - continuous or batch -- processes of material transformation. The design of such processes, and t...
Matthias Jarke, Thomas List, Klaus Weidenhaupt
AAAI
2008
15 years 6 months ago
POIROT - Integrated Learning of Web Service Procedures
POIROT is an integration framework for combining machine learning mechanisms to learn hierarchical models of web services procedures from a single or very small set of demonstrati...
Mark H. Burstein, Robert Laddaga, David McDonald, ...