Sciweavers

953 search results - page 89 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
VALUETOOLS
2006
ACM
125views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
An approximative method for calculating performance measures of Markov processes
We present a new approximation method called value extrapolation for Markov processes with large or infinite state spaces. The method can be applied for calculating any performan...
Juha Leino, Jorma T. Virtamo
NIPS
2008
13 years 9 months ago
Measures of Clustering Quality: A Working Set of Axioms for Clustering
Aiming towards the development of a general clustering theory, we discuss abstract axiomatization for clustering. In this respect, we follow up on the work of Kleinberg, ([1]) tha...
Shai Ben-David, Margareta Ackerman
IACR
2011
113views more  IACR 2011»
12 years 7 months ago
GNUC: A New Universal Composability Framework
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), alr...
Dennis Hofheinz, Victor Shoup
IACR
2011
91views more  IACR 2011»
12 years 7 months ago
A Scalable Method for Constructing Galois NLFSRs with Period $2^n-1$ using Cross-Join Pairs
This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a ...
Elena Dubrova
APSEC
2001
IEEE
13 years 11 months ago
A Slicing Method for Object-Oriented Programs Using Lightweight Dynamic Information
Program slicing has been used for efficient program debugging activities. Program slice is computed by analyzing dependence relations between program statements. We can divide dep...
Fumiaki Ohata, Kouya Hirose, Masato Fujii, Katsuro...