2034 search results - page 34 / 407 » Substring Selectivity Estimation |
157
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
137
click to vote
ICDE
2012
IEEE
13 years 3 days ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
AAAI
2012
13 years 1 days 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...
74
Voted
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider the least-square linear regression problem with regularization by the 1-norm, a problem usually referred to as the Lasso. In this paper, we present a detailed asymptot...
IEICET
2007
14 years 9 months ago
2007
Estimating the generalization error is one of the key ingredients of supervised learning since a good generalization error estimator can be used for model selection. An unbiased g...