2944 search results - page 109 / 589 » Improving Bound Propagation |
WADS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
NIPS
2004
13 years 11 months ago
2004
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...
WAOA
2004
Springer
14 years 3 months ago
2004
Springer
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
IPL
2008
13 years 10 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
MOC
1998
13 years 9 months ago
1998
We improve a criterion of Inkeri and show that if there is a solution to Catalan’s equation xp − yq = ±1,(1) with p and q prime numbers greater than 3 and both congruent to 3 ...