404 search results - page 77 / 81 » Structure Discovery from Sequential Data |
100
click to vote
CF
2006
ACM
15 years 3 months ago
2006
ACM
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...
77
Voted
ERCIMDL
2009
Springer
15 years 2 months ago
2009
Springer
Curated databases are databases that are populated and updated with a great deal of human effort. Most reference works that one traditionally found on the reference shelves of li...
SC
1992
ACM
15 years 1 months ago
1992
ACM
We are currently developing Willow, a shared-memory multiprocessor whose design provides system capacity and performance capable of supporting over a thousand commercial microproc...
112
click to vote
SOICT
2010
14 years 4 months ago
2010
Protecting data by passwords in documents such as DOC, PDF or RAR, ZIP archives has been demonstrated to be weak under dictionary attacks. Time for recovering the passwords of suc...
77
Voted
KDD
1998
ACM
15 years 1 months ago
1998
ACM
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...