4843 search results - page 187 / 969 » The Shortcut Problem - Complexity and Approximation |
163
click to vote
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
131
click to vote
ADHOCNOW
2008
Springer
15 years 9 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
131
click to vote
IDEAS
2007
IEEE
15 years 9 months ago
2007
IEEE
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
129
Voted
FORMATS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
123
click to vote
ICANN
2007
Springer
15 years 9 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...