Sciweavers

6110 search results - page 119 / 1222
» Approximate Computing
Sort
View
JSC
2006
132views more  JSC 2006»
15 years 6 months ago
From an approximate to an exact absolute polynomial factorization
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
Guillaume Chèze, André Galligo
ISCAS
2006
IEEE
70views Hardware» more  ISCAS 2006»
16 years 12 days ago
A systolic array technique for determining common approximate substrings
— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introdu...
Kenneth B. Kent, Jacqueline E. Rice
SACMAT
2006
ACM
16 years 10 days ago
The secondary and approximate authorization model and its application to Bell-LaPadula policies
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
Jason Crampton, Wing Leung, Konstantin Beznosov
FOCS
2006
IEEE
16 years 13 days ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
DCG
2000
104views more  DCG 2000»
15 years 6 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan