Sciweavers

191 search results - page 18 / 39
» Expected Utility with Multiple Priors
Sort
View
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 9 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
ETS
2011
IEEE
230views Hardware» more  ETS 2011»
12 years 9 months ago
Dynamic Test Set Selection Using Implication-Based On-Chip Diagnosis
—As circuits continue to scale to smaller feature sizes, wearout and latent defects are expected to cause an increasing number of errors in the field. Online error detection tec...
Nuno Alves, Y. Shi, N. Imbriglia, Jennifer Dworak,...
ECOWS
2007
Springer
14 years 4 months ago
Nonblocking Scheduling for Web Service Transactions
For improved flexibility and concurrent usage existing transaction management models for Web services relax the isolation property of Web service-based transactions. Correctness o...
Mohammad Alrifai, Wolf-Tilo Balke, Peter Dolog, Wo...
CAE
2007
14 years 6 days ago
Celtic Knots Colorization based on Color Harmony Principles
This paper proposes two simple and powerful algorithms to automatically paint Celtic knots with aesthetic colors. The shape of the knot is generated from its dual graph as present...
Caroline Larboulette
TSP
2010
13 years 4 months ago
Multichannel deconvolution of seismic signals using statistical MCMC methods
In this paper we propose two multichannel blind deconvolution algorithms for the restoration of two-dimensional (2D) seismic data. Both algorithms are based on a 2D reflectivity pr...
Idan Ram, Israel Cohen, Shalom Raz