6110 search results - page 44 / 1222 » Approximate Computing |
ICDT
2005
ACM
15 years 3 months ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
FCT
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. It is proved that everywhere-dense Min 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.
TSMC
2010
14 years 4 months ago
2010
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
AI
2005
Springer
14 years 9 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph