Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
95
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). In: Dwork
- CRYPTO 2006. LNCS,
, 2006
"... Abstract We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract
-
Cited by 119 (10 self)
- Add to MetaCart
Σ ∈ N in unary, and the hierarchy's maximum depth D ∈ N, the setup algorithm first generates a bilinear instance 1. Select 7 + 5 D + D 2 random integers modulo p (some of them forcibly non-zero): 2. Publish G and the system parameters Pub ∈ G T × G 2 (1+D) (2+D) given by: 3. Retain the master
Local Parallel Biomolecular Computation *
"... Biomolecular Computation (BMC) is computation at the molecular scale, using biotechnology engineering techniques. Most proposed methods for BMC used distributed (molecular) parallelism (DP); where operations are executed in parallel on large numbers of distinct molecules. BMC done exclusively by DP ..."
Abstract
- Add to MetaCart
and and significantly decrease the assembly depth. We give LP-BMC algorithms with linear assembly size and logarithmic assembly depth, for the parallel prefix computation problems, which include integer addition, subtraction, multiplication by a constant number, finite state automata simulation, and fingerprinting
Transactions on Parallel and Distributed Systems
"... (MMOGs) can include millions of concurrent players spread across the world and interacting with each other within a single session. Faced with high resource demand variability and with misfit resource renting policies, the current industry practice is to over-provision for each game tens of self-own ..."
Abstract
- Add to MetaCart
-owned data centres, making the market entry affordable only for big companies. Focusing on the reduction of entry and operational costs, we investigate a new dynamic resource provisioning method for MMOG operation using external data centres as low-cost resource providers. First, we identify in the various
Sequential Importance Sampling Algorithms for Estimating the All-terminal Reliability Polynomial of Sparse Graphs
"... Abstract The all-terminal reliability polynomial of a graph counts its connected subgraphs of various sizes. Algorithms based on sequential importance sampling (SIS) have been proposed to estimate a graph's reliability polynomial. We show upper bounds on the relative error of three sequential ..."
Abstract
- Add to MetaCart
known algorithm; for graphs of average degree ≤ 45 it is the fastest known polynomial-space algorithm. For example, when a graph has average degree 3, this algorithm estimates to error in time O (1.26 n −2 ). Although the algorithm may take exponential time, in practice it can have good performance
The BKZ Simulation Algorithm
"... Hiermit versichere ich, die vorliegende Bachelor-Thesis ohne Hilfe Dritter nur mit den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus Quellen entnommen wurden, sind als solche kenntlich gemacht. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbe ..."
Abstract
- Add to MetaCart
Prüfungsbehörde vorgelegen. Darmstadt, den 08. 07. 2013 (Tobias Hamann) The best reduction algorithm for lattices with high dimensions known today is the BKZ reduction algorithm by Schnorr and Euchner. The running time of the BKZ reduction algorithm, however, increases significantly with higher blocksizes
ALGEBRAIC ALGORITHMS1
, 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up- ..."
Abstract
- Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up-
UNIVERSITY Scalability of algorithms for arithmetic's operations in radix notation
"... Demonstrative computing is the necessary and sufficient tooling means for algorithmic analysis of large scale unstable problems. The library "Exact computation " gives required true instruments at distributed computing environment. Further increasing of effectiveness of such software is po ..."
Abstract
- Add to MetaCart
is possible for account of heterogeneous computing environment allowing to parallelize performance of local arithmetic operations at big number of streams. Application of redundant positional notations is effective approach for increasing of arithmetic algorithms scalability. The results on scalability
Efficient and Fast RNC Algorithms for the Uniform Generation of Unlabelled Graphs
"... This paper is concerned with the problem of generating unlabelled graphs uniformly at random (u.a.r.) by means of efficient parallel algorithms. Our model of computation is the well-known (see [6], for example) parallel random access machine (PRAM) augmented with a facility to generate random number ..."
Abstract
- Add to MetaCart
on the exclusive-read exclusive-write variant of the PRAM (the EREW PRAM) with addition, subtraction, multiplication and division as basic set of operations. A PRAM algorithm, in particular, is said to be optimal (see [6]) if the product of its parallel running time t times the number of processor used p is within
RICE UNIVERSITY Regime Change: Sampling Rate vs. Bit-Depth in Compressive Sensing
, 2011
"... The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of t ..."
Abstract
- Add to MetaCart
The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order
Results 1 - 10
of
95
