1142 search results - page 53 / 229 » Approximability of Clausal Constraints |
189
click to vote
SIBGRAPI
2008
IEEE
16 years 17 days ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
152
click to vote
SPIRE
1999
Springer
15 years 10 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
151
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
162
click to vote
AGP
1995
IEEE
15 years 9 months ago
1995
IEEE
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
134
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...