7150 search results - page 302 / 1430 » An Approximation Algorithm for Approximation Rank |
189
click to vote
ESA
2005
Springer
16 years 6 days 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...
184
Voted
CALC
2001
Springer
15 years 11 months ago
2001
Springer
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
178
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
201
click to vote
AIMSA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
174
Voted
NIPS
2007
15 years 8 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...