6110 search results - page 296 / 1222 » Approximate Computing |
189
click to vote
CEAS
2005
Springer
15 years 8 months ago
2005
Springer
Human interaction proofs (HIPs) have become commonplace on the internet for protecting free online services from abuse by automated scripts/bots. They are challenges designed to b...
171
click to vote
ARITH
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of both 2-D Discrete Cosine Transform and Inverse DCT. The architecture uses a...
187
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
156
click to vote
ICRA
2006
IEEE
16 years 21 days ago
2006
IEEE
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
153
click to vote
ICCD
2002
IEEE
16 years 3 months ago
2002
IEEE
During the course of a program’s execution, a processor performs many trivial computations; that is, computations that can be simplified or where the result is zero, one, or equ...