6110 search results - page 794 / 1222 » Approximate Computing |
172
click to vote
SPIN
2009
Springer
16 years 1 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
173
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
172
click to vote
AINA
2007
IEEE
16 years 1 months ago
2007
IEEE
In the Ad-Hoc InfoWare project, we develop a delay tolerant event notification service for sparse Mobile Ad-Hoc Networks for emergency and rescue operations. In most event notific...
135
click to vote
ARITH
2007
IEEE
16 years 1 months ago
2007
IEEE
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
170
click to vote
BROADNETS
2007
IEEE
16 years 1 months ago
2007
IEEE
—Packet based wireless networks have provided high data rates, and the desire for ubiquitous wireless computing is growing rapidly. To accommodate these demands, wireless systems...