1933 search results - page 46 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
JAL
2006
13 years 8 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
IJON
2000
2000
Synthesis approach for bidirectional associative memories based on the perceptron training algorithm
13 years 8 months ago
Bidirectional associative memories are being used extensively for solving a variety of problems related to pattern recognition. In the present paper, a new synthesis approach is d...
MFCS
2004
Springer
14 years 2 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...