Sciweavers

379 search results - page 73 / 76
» The Graham-Knowlton Problem Revisited
Sort
View
CONCUR
2010
Springer
13 years 7 months ago
On the Compositionality of Round Abstraction
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
Dan R. Ghica, Mohamed N. Menaa
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 7 months ago
Sequential Rationality in Cryptographic Protocols
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationallybounded pl...
Ronen Gradwohl, Noam Livne, Alon Rosen
EOR
2010
125views more  EOR 2010»
13 years 7 months ago
Efficient estimation of large portfolio loss probabilities in t-copula models
We consider the problem of accurately measuring the credit risk of a portfolio consisting of loans, bonds and other financial assets. One particular performance measure of interes...
Joshua C. C. Chan, Dirk P. Kroese
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 7 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
INTEGRATION
2008
191views more  INTEGRATION 2008»
13 years 7 months ago
Constant-time addition with hybrid-redundant numbers: Theory and implementations
Abstract: Hybrid-redundant number representation has provided a flexible framework for digitparallel addition in a manner that facilitates area-time tradeoffs for VLSI implementati...
Ghassem Jaberipur, Behrooz Parhami