Sciweavers

16430 search results - page 877 / 3286
» On Computable Tree Functions
Sort
View
CVPR
2009
IEEE
17 years 2 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...
ICPPW
2009
IEEE
16 years 2 months ago
Fast Autotuning Configurations of Parameters in Distributed Computing Systems Using Ordinal Optimization
Conventional autotuning configuration of parameters in distributed computing systems using evolutionary strategies increases integrated performance notably, though at the expense ...
Fan Zhang, Junwei Cao, Lianchen Liu, Cheng Wu
ICICS
2009
Springer
16 years 2 months ago
Secure Remote Execution of Sequential Computations
Abstract. We describe a scheme that secures the remote execution of sequential computations in grid-computing scenarios. To the best of our knowledge, this is the first contributi...
Ghassan Karame, Mario Strasser, Srdjan Capkun
ANSS
2007
IEEE
16 years 2 months ago
Evaluating the Design of Biological Cells Using a Computer Workbench
For embedded systems as well as for biological cell systems, design is a feature that defines their identity. The assembly of different components in designs of both systems can ...
Tessa E. Pronk, Simon Polstra, Andy D. Pimentel, T...
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
16 years 1 months 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