Sciweavers

1717 search results - page 131 / 344
» A Computable Spectral Theorem
Sort
View
IPPS
2009
IEEE
15 years 11 months ago
Robust sequential resource allocation in heterogeneous distributed systems with random compute node failures
—The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of comp...
Vladimir Shestak, Edwin K. P. Chong, Anthony A. Ma...
ECCC
2008
98views more  ECCC 2008»
15 years 4 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
ENTCS
2006
136views more  ENTCS 2006»
15 years 4 months ago
Classically-controlled Quantum Computation
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
Simon Perdrix, Philippe Jorrand
138
Voted
JCS
2010
112views more  JCS 2010»
15 years 3 months ago
Inductive trace properties for computational security
Protocol authentication properties are generally trace-based, meaning that authentication holds for the protocol if authentication holds for individual traces (runs of the protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
136
Voted
RECOMB
2007
Springer
16 years 4 months ago
Beyond Galled Trees - Decomposition and Computation of Galled Networks
Reticulate networks are a type of phylogenetic network that are used to represent reticulate evolution involving hybridization, horizontal gene transfer or recombination. The simpl...
Daniel H. Huson, Tobias H. Klöpper