15 search results - page 3 / 3 » Optimizing Grammars for Minimum Dependency Length |
ICMCS
2006
IEEE
13 years 10 months ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
ICIP
2003
IEEE
13 years 10 months ago
2003
IEEE
We describe a general framework to design optimal image processing algorithms for polarimetric images formed with coherent radiations, which can be optical or microwave. Starting ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In order to achieve fault tolerance, highly reliable system often require the ability to detect errors as soon as they occur and prevent the speared of erroneous information throu...
DATE
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract--Leakage power consumption contributes significantly to the overall power dissipation for systems that are manufactured in advanced deep sub-micron technology. Different f...
SPAA
2010
ACM
13 years 9 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...