1343 search results - page 56 / 269 » Learning Weighted Automata |
SIGCSE
2009
ACM
14 years 10 months ago
2009
ACM
We describe the results from a two-year study with fourteen universities on presenting formal languages in a more visual, interactive and applied manner using JFLAP. In our result...
ATVA
2011
Springer
12 years 10 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
NETWORKING
2007
13 years 11 months ago
2007
We consider event dependent routing algorithms for on-line explicit source routing in MPLS networks. The proposed methods are based on load shared sequential routing in which load ...
COLT
2005
Springer
14 years 3 months ago
2005
Springer
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
ICDM
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper, we propose a semi-supervised framework for learning a weighted Euclidean subspace, where the best clustering can be achieved. Our approach capitalizes on user-const...