Sciweavers

416 search results - page 39 / 84
» Processing Textbook-Style Matrices
Sort
View
SERP
2003
13 years 11 months ago
Automatic Benchmarking and Optimization of Codes: An Experience with Numerical Kernels
Abstract New algorithms are constantly developed in search of better or faster results. Many variants of code are often tried while searching for the best solution. When the number...
José R. Herrero, Juan J. Navarro
ACL
1997
13 years 11 months ago
Fast Context-Free Parsing Requires Fast Boolean Matrix Multiplication
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
Lillian Lee
ICML
2010
IEEE
13 years 11 months ago
A New Analysis of Co-Training
In this paper, we present a new analysis on co-training, a representative paradigm of disagreement-based semi-supervised learning methods. In our analysis the co-training process ...
Wei Wang, Zhi-Hua Zhou
AUTOMATICA
2007
90views more  AUTOMATICA 2007»
13 years 10 months ago
Stability analysis of discrete-time iterative learning control systems with interval uncertainty
This paper presents a stability analysis of the iterative learning control (ILC) problem for discrete-time systems when the plant Markov parameters are subject to interval uncerta...
Hyo-Sung Ahn, Kevin L. Moore, Yangquan Chen
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 10 months ago
A Multilevel Approach For Nonnegative Matrix Factorization
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particul...
Nicolas Gillis, François Glineur