204 search results - page 2 / 41 » Fast Set Operations Using Treaps |
USENIX
1990
13 years 8 months ago
1990
This paper evaluates several hardware platforms and operating systems using a set of benchmarks that stress kernel entry/exit, file systems, and other things related to operating ...
DATE
2002
IEEE
14 years 2 days ago
2002
IEEE
To enable fast and accurate evaluation of HW/SW implementation choices of on-chip communication, we present a method to automatically generate timed OS simulation models. The meth...
ASAP
2004
IEEE
13 years 11 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
DMKD
1997
ACM
13 years 11 months ago
1997
ACM
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
ICCV
2009
IEEE
13 years 4 months ago
2009
IEEE
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...