Sciweavers

1435 search results - page 45 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
COMPGEOM
2009
ACM
14 years 3 months ago
A general approach for cache-oblivious range reporting and approximate range counting
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 1 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
CIKM
2011
Springer
12 years 8 months ago
Semi-supervised multi-task learning of structured prediction models for web information extraction
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
Paramveer S. Dhillon, Sundararajan Sellamanickam, ...
ICC
2007
IEEE
14 years 2 months ago
Computing Maximum-Likelihood Bounds for Reed-Solomon Codes over Partial Response Channels
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
Richard M. Todd, J. R. Cruz
SIAMSC
2010
157views more  SIAMSC 2010»
13 years 6 months ago
Certified Reduced Basis Methods and Output Bounds for the Harmonic Maxwell's Equations
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the ha...
Yanlai Chen, Jan S. Hesthaven, Yvon Maday, Jer&oac...