900 search results - page 87 / 180 » On Polynomial Time Computation over Unordered Structures |
CHES
2000
Springer
14 years 1 months ago
2000
Springer
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
WIOPT
2010
IEEE
13 years 7 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
This paper details an empirical study of large image sets taken by static cameras. These images have consistent correlations over the entire image and over time scales of days to ...
CSR
2007
Springer
14 years 3 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
APPROX
2006
Springer
14 years 17 days ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...