6110 search results - page 738 / 1222 » Approximate Computing |
173
click to vote
COMPGEOM
1999
ACM
15 years 11 months ago
1999
ACM
We propose a speed-up method for discrete-event simulations, including sweep-line or -plane techniques, requiring the repeated calculation of the times at which certain discrete e...
181
click to vote
SEAL
1998
Springer
15 years 11 months ago
1998
Springer
Most of the obstacle avoidance techniques do not consider the robot orientation or its nal angle at the target position. These techniques deal with the robot position only and are ...
160
click to vote
VLSID
1993
IEEE
15 years 11 months ago
1993
IEEE
An area-eficzent systolic architecture for realtime, programmable-coeBcient jinite impulse response (FIR)filters is presented. A technique called pipelined clustering is introduce...
179
click to vote
COLT
1993
Springer
15 years 11 months ago
1993
Springer
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...
157
click to vote
ASPDAC
2007
ACM
15 years 11 months ago
2007
ACM
In today's designs, when functional verification fails, engineers perform debugging using the provided error traces. Reducing the length of error traces can help the debugging...