5055 search results - page 232 / 1011 » Relative Timing |
172
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
146
click to vote
ANSS
2001
IEEE
15 years 10 months ago
2001
IEEE
We present the definition of diverse models of physical systems using the Cell-DEVS paradigm. Cell-DEVS is an extension of the DEVS formalism that allows the definition of cellula...
156
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
150
click to vote
CHES
2000
Springer
15 years 11 months ago
2000
Springer
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
175
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...