Sciweavers

1435 search results - page 134 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
AUTOMATICA
2002
97views more  AUTOMATICA 2002»
14 years 9 months ago
Frequency-domain subspace system identification using non-parametric noise models
- In the general case of non-uniformly spaced frequency domain data and/or arbitrarily colored disturbing noise, the frequency domain subspace identification algorithms described i...
Rik Pintelon
POPL
2007
ACM
15 years 10 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
ECCC
2011
202views ECommerce» more  ECCC 2011»
14 years 5 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain
ICANN
2001
Springer
15 years 2 months ago
Incremental Support Vector Machine Learning: A Local Approach
Abstract. In this paper, we propose and study a new on-line algorithm for learning a SVM based on Radial Basis Function Kernel: Local Incremental Learning of SVM or LISVM. Our meth...
Liva Ralaivola, Florence d'Alché-Buc
79
Voted
EDBT
2006
ACM
105views Database» more  EDBT 2006»
15 years 10 months ago
HASE: A Hybrid Approach to Selectivity Estimation for Conjunctive Predicates
Current methods for selectivity estimation fall into two broad categories, synopsis-based and sampling-based. Synopsis-based methods, such as histograms, incur minimal overhead at ...
Xiaohui Yu, Nick Koudas, Calisto Zuzarte