1554 search results - page 164 / 311 » Parameterized Complexity and Approximation Algorithms |
163
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
150
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
178
click to vote
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
191
click to vote
TIP
2008
15 years 6 months ago
2008
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
176
click to vote
UAI
2004
15 years 7 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...