841 search results - page 37 / 169 » Approximability of Minimum AND-Circuits |
ICIP
1998
IEEE
14 years 10 months ago
1998
IEEE
Abstract- We investigate the functions of given approximation order L that have the smallest support. Those are shown to be linear combinations of the Bspline of degree .L - 1 and ...
ISAAC
2004
Springer
14 years 2 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
ICDCS
2008
IEEE
14 years 3 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...