252 search results - page 46 / 51 » Entropy Based Associative Memory |
83
Voted
CN
2008
14 years 9 months ago
2008
In the past years there has been significant research on developing compact data structures for summarizing large data streams. A family of such data structures is the so-called s...
SSS
2009
Springer
15 years 4 months ago
2009
Springer
: The Borowsky-Gafni (BG) simulation algorithm is a powerful tool that allows a set of t + 1 asynchronous sequential processes to wait-free simulate (i.e., despite the crash of up ...
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
103
click to vote
IJCNN
2000
IEEE
15 years 2 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
RTSS
2000
IEEE
15 years 2 months ago
2000
IEEE
The maturity of schedulabilty analysis techniquesfor fired-prioritypreemptive scheduling has enabled the consideration of timing issues at design time using a specification of the...