Sciweavers

1066 search results - page 46 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
ICCAD
2007
IEEE
131views Hardware» more  ICCAD 2007»
15 years 6 months ago
Low-overhead design technique for calibration of maximum frequency at multiple operating points
— Determination of maximum operating frequencies (Fmax) during manufacturing test at different operating voltages is required to: (a) to ensure that, for a Dynamic Voltage and Fr...
Somnath Paul, Sivasubramaniam Krishnamurthy, Hamid...
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
15 years 10 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
SOSP
2007
ACM
15 years 6 months ago
Secure virtual architecture: a safe execution environment for commodity operating systems
This paper describes an efficient and robust approach to provide a safe execution environment for an entire operating system, such as Linux, and all its applications. The approach...
John Criswell, Andrew Lenharth, Dinakar Dhurjati, ...
MFCS
2005
Springer
15 years 3 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
ASAP
2007
IEEE
107views Hardware» more  ASAP 2007»
15 years 4 months ago
A Hardware-Oriented Method for Evaluating Complex Polynomials
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
Milos D. Ercegovac, Jean-Michel Muller