Sciweavers

654 search results - page 19 / 131
» On Iterative Regularization and Its Application
Sort
View
ENTCS
2008
79views more  ENTCS 2008»
14 years 9 months ago
The Compositional Method and Regular Reachability
The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its fact...
Ingo Felscher
APIN
2000
103views more  APIN 2000»
14 years 9 months ago
Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...
Brian J. Ross
95
Voted
SIAMMAX
2010
189views more  SIAMMAX 2010»
14 years 4 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng
WCRE
2010
IEEE
14 years 7 months ago
Mining Source Code for Structural Regularities
Abstract—During software development, design rules and contracts in the source code are often encoded through regularities, such as API usage protocols, coding idioms and naming ...
Angela Lozano, Andy Kellens, Kim Mens, Gabriela Ar...
ICASSP
2011
IEEE
14 years 1 months ago
Unsupervised vocabulary discovery using non-negative matrix factorization with graph regularization
In this paper, we present a model for unsupervised pattern discovery using non-negative matrix factorization (NMF) with graph regularization. Though the regularization can be appl...
Meng Sun, Hugo Van hamme