Sciweavers

29082 search results - page 383 / 5817
» The Time-Triggered Model of Computation
Sort
View
TCS
2011
15 years 1 months ago
Computational processes, observers and Turing incompleteness
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
Klaus Sutner
CVPR
2009
IEEE
17 years 1 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
CCS
2010
ACM
16 years 1 months ago
Secure provenance: the essential of bread and butter of data forensics in cloud computing
Secure provenance that records ownership and process history of data objects is vital to the success of data forensics in cloud computing, yet it is still a challenging issue toda...
Rongxing Lu, Xiaodong Lin, Xiaohui Liang, Xuemin (...
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
16 years 29 days ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
IPPS
2006
IEEE
16 years 24 days ago
Dynamic resource allocation of computer clusters with probabilistic workloads
Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-tim...
Marwan S. Sleiman, Lester Lipsky, Robert Sheahan