242 search results - page 9 / 49 » Approximate substring selectivity estimation |
AAAI
2012
11 years 9 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
EDBT
2009
ACM
13 years 12 months ago
2009
ACM
The concept of time-constrained SQL queries was introduced to address the problem of long-running SQL queries. A key approach adopted for supporting time-constrained SQL queries i...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The 1 norm regularized least square technique has been proposed as an efficient method to calculate sparse solutions. However, the choice of the regularization parameter is still...
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...