2479 search results - page 251 / 496 » A Computational Theory of Working Memory |
196
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
176
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
221
click to vote
SIGSOFT
2003
ACM
16 years 7 months ago
2003
ACM
Writes via unchecked pointer dereferences rank high among vulnerabilities most often exploited by malicious code. The most common attacks use an unchecked string copy to cause a b...
210
click to vote
CF
2006
ACM
16 years 19 days 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, ...
180
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...