Sciweavers

9842 search results - page 1893 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
EUROCRYPT
2010
Springer
14 years 15 days ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...
ICSE
2010
IEEE-ACM
14 years 14 days ago
A methodology to support load test analysis
Performance analysts rely heavily on load testing to measure the performance of their applications under a given load. During the load test, analyst strictly monitor and record th...
Haroon Malik
HOTSWUP
2009
ACM
14 years 11 days ago
Automating Database Schema Evolution in Information System Upgrades
The complexity, cost, and down-time currently created by the database schema evolution process is the source of incessant problems in the life of information systems and a major s...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 6 days ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
ICCS
2001
Springer
14 years 4 days ago
High-Performance Algorithm Engineering for Computational Phylogenetics
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
Bernard M. E. Moret, David A. Bader, Tandy Warnow
« Prev « First page 1893 / 1969 Last » Next »