Sciweavers

29082 search results - page 240 / 5817
» The Time-Triggered Model of Computation
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 6 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
CSFW
2008
IEEE
16 years 1 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
TOG
2012
255views Communications» more  TOG 2012»
13 years 9 months ago
A probabilistic model for component-based shape synthesis
We present an approach to synthesizing shapes from complex domains, by identifying new plausible combinations of components from existing shapes. Our primary contribution is a new...
Evangelos Kalogerakis, Siddhartha Chaudhuri, Daphn...
FCS
2009
15 years 4 months ago
Circuits as a Classifier for Small-World Network Models
The number and length distribution of circuits or loops in a graph or network give important insights into its key characteristics. We discuss the circuit properties of various sm...
Arno Leist, Kenneth A. Hawick
JMLR
2012
13 years 9 months ago
Generic Methods for Optimization-Based Modeling
“Energy” models for continuous domains can be applied to many problems, but often suffer from high computational expense in training, due to the need to repeatedly minimize t...
Justin Domke