539 search results - page 40 / 108 » Recurrence relations and fast algorithms |
93
Voted
IWMM
2007
Springer
15 years 6 months ago
2007
Springer
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
124
click to vote
MYCRYPT
2005
Springer
15 years 6 months ago
2005
Springer
Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using simi...
104
click to vote
FPGA
1998
ACM
15 years 4 months ago
1998
ACM
Three factors are driving the demand for rapid FPGA compilation. First, as FPGAs have grown in logic capacity, the compile computation has grown more quickly than the compute powe...
119
click to vote
KDD
1997
ACM
15 years 4 months ago
1997
ACM
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
100
Voted
KRMED
2008
15 years 1 months ago
2008
By constructing local extensions to SNOMED we aim to enrich existing medical and related data stores, simplify the expression of complex queries, and establish a foundation for se...