213 search results - page 27 / 43 » Counting Independent Sets Using the Bethe Approximation |
LCN
2008
IEEE
15 years 6 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
RTSS
2008
IEEE
15 years 6 months ago
2008
IEEE
We consider the problem of optimal static period assignment for multiple independent control tasks executing on the same CPU. Previous works have assumed that the control performa...
SSS
2009
Springer
15 years 4 months ago
2009
Springer
We propose a communication scheme for GALS systems with independent but approximately synchronized clock sources, which guarantees high-speed metastability-free communication betwe...
159
click to vote
HCI
2009
14 years 9 months ago
2009
Abstract. We propose a brain-computer interface (BCI) system for evolving images in realtime based on subject feedback derived from electroencephalography (EEG). The goal of this s...
STOC
2003
ACM
16 years 3 days ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...