Sciweavers

1797 search results - page 84 / 360
» Regularized Winnow Methods
Sort
View
CORR
2009
Springer
99views Education» more  CORR 2009»
13 years 6 months ago
Quotient Complexity of Regular Languages
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
Janusz A. Brzozowski
ICASSP
2008
IEEE
14 years 3 months ago
Action recognition using spatio-temporal regularity based features
In this paper, a novel feature for capturing information in a spatio-temporal volume based on regularity flow is presented for action recognition. The regularity flow describes ...
Taylor Goodhart, Pingkun Yan, Mubarak Shah
ICALP
2000
Springer
14 years 20 days ago
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...
Jesper G. Henriksen, Madhavan Mukund, K. Narayan K...
ICML
2007
IEEE
14 years 10 months ago
Scalable training of L1-regularized log-linear models
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
Galen Andrew, Jianfeng Gao
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 9 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...