Sciweavers

3044 search results - page 191 / 609
» Linear logical approximations
Sort
View
146
Voted
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
15 years 10 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
139
Voted
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
15 years 7 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
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...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
CADE
2009
Springer
16 years 4 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
DATE
2008
IEEE
143views Hardware» more  DATE 2008»
15 years 10 months ago
Improving Synthesis of Compressor Trees on FPGAs via Integer Linear Programming
Multi-input addition is an important operation for many DSP and video processing applications. On FPGAs, multi-input addition has traditionally been implemented using trees of car...
Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne
129
Voted
APLAS
2004
ACM
15 years 9 months ago
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
Koichi Kodama, Kohei Suenaga, Naoki Kobayashi