9359 search results - page 102 / 1872 » Generalization Algorithms for Second-Order Terms |
133
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
166
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
119
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
137
click to vote
SAC
2009
ACM
15 years 10 months ago
2009
ACM
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...
137
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...