Sciweavers

5210 search results - page 229 / 1042
» Exact geometric computation
Sort
View
DCC
2005
IEEE
16 years 6 months ago
Asymptotics of the Entropy Rate for a Hidden Markov Process
We calculate the Shannon entropy rate of a binary Hidden Markov Process (HMP), of given transition rate and noise (emission), as a series expansion in . The first two orders are ca...
Or Zuk, Ido Kanter, Eytan Domany
MOC
1998
64views more  MOC 1998»
15 years 6 months ago
Analysis of non-overlapping domain decomposition algorithms with inexact solves
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
James H. Bramble, Joseph E. Pasciak, Apostol T. Va...
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
15 years 12 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
ISLPED
2005
ACM
96views Hardware» more  ISLPED 2005»
16 years 4 days ago
Region-level approximate computation reuse for power reduction in multimedia applications
ABSTRACT Motivated by data value locality and quality tolerance present in multimedia applications, we propose a new micro-architecture, Region-level Approximate Computation Buffer...
Xueqi Cheng, Michael S. Hsiao
WINE
2009
Springer
93views Economy» more  WINE 2009»
16 years 1 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...