Sciweavers

10599 search results - page 76 / 2120
» Measure Based Regularization
Sort
View
FOSSACS
2008
Springer
13 years 9 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
ICGI
2010
Springer
13 years 9 months ago
Inferring Regular Trace Languages from Positive and Negative Samples
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
Antonio Cano Gómez
CSDA
2007
96views more  CSDA 2007»
13 years 8 months ago
On a quadratic eigenproblem occurring in regularized total least squares
In a recent paper Sima, Van Huffel and Golub [Regularized total least squares based on quadratic eigenvalue problem solvers. BIT Numerical Mathematics 44, 793 - 812 (2004)] sugges...
J. Lampe, H. Voss
JMLR
2010
143views more  JMLR 2010»
13 years 2 months ago
Regularized Discriminant Analysis, Ridge Regression and Beyond
Fisher linear discriminant analysis (FDA) and its kernel extension--kernel discriminant analysis (KDA)--are well known methods that consider dimensionality reduction and classific...
Zhihua Zhang, Guang Dai, Congfu Xu, Michael I. Jor...
ICCV
2007
IEEE
14 years 10 months ago
Vector Quantizing Feature Space with a Regular Lattice
Most recent class-level object recognition systems work with visual words, i.e., vector quantized local descriptors. In this paper we examine the feasibility of a dataindependent ...
Tinne Tuytelaars, Cordelia Schmid