Sciweavers

6110 search results - page 290 / 1222
» Approximate Computing
Sort
View
TOCL
2002
110views more  TOCL 2002»
15 years 6 months ago
Abstract computability and algebraic specification
Computability and Algebraic Specification J. V. TUCKER University of Wales, Swansea and J. I. ZUCKER McMaster University Abstract computable functions are defined by abstract finit...
J. V. Tucker, Jeffery I. Zucker
DCC
2011
IEEE
15 years 1 months ago
Some observations on HC-128
In this paper, we use linear approximations of the addition modulo 2n of three n-bit integers to identify linear approximations of g1, g2, the feedback functions of HC-128. This, i...
Subhamoy Maitra, Goutam Paul, Shashwat Raizada, Su...
SOFSEM
2010
Springer
16 years 3 months ago
On the Complexity of the Highway Pricing Problem
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...
Alexander Grigoriev, Joyce van Loon, Marc Uetz
SI3D
2006
ACM
16 years 18 days ago
Interactive 3D distance field computation using linear factorization
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D...
FOCS
2007
IEEE
16 years 1 months ago
Towards Sharp Inapproximability For Any 2-CSP
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Per Austrin