841 search results - page 42 / 169 » Approximability of Minimum AND-Circuits |
IPL
2002
13 years 8 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
STOC
1998
ACM
14 years 1 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
NPL
2008
13 years 9 months ago
2008
We introduce two new methods of deriving the classical PCA in the framework of minimizing the mean square error upon performing a lower-dimensional approximation of the data. These...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...