2957 search results - page 306 / 592 » The Complexity of Polynomial-Time Approximation |
156
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...
182
click to vote
EDBT
2009
ACM
15 years 10 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...
163
Voted
AAAI
2007
15 years 9 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
199
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...
163
click to vote
JCSS
2007
15 years 6 months ago
2007
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...