7930 search results - page 427 / 1586 » Greedy in Approximation Algorithms |
204
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
182
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
190
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...
183
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 ...
210
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 ...