Sciweavers

3724 search results - page 88 / 745
» Timed regular expressions
Sort
View
125
Voted
ICML
2007
IEEE
16 years 4 months ago
On one method of non-diagonal regularization in sparse Bayesian learning
In the paper we propose a new type of regularization procedure for training sparse Bayesian methods for classification. Transforming Hessian matrix of log-likelihood function to d...
Dmitry Kropotov, Dmitry Vetrov
FUIN
2007
133views more  FUIN 2007»
15 years 3 months ago
Intercode Regular Languages
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
Yo-Sub Han, Kai Salomaa, Derick Wood
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
15 years 5 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
CEC
2010
IEEE
14 years 11 months ago
Parameter estimation with term-wise decomposition in biochemical network GMA models by hybrid regularized Least Squares-Particle
High-throughput analytical techniques such as nuclear magnetic resonance, protein kinase phosphorylation, and mass spectroscopic methods generate time dense profiles of metabolites...
Prospero C. Naval, Luis G. Sison, Eduardo R. Mendo...
STACS
2001
Springer
15 years 8 months ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov