Sciweavers

3270 search results - page 68 / 654
» Approximate String Processing
Sort
View
MLG
2007
Springer
15 years 4 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
FOIKS
2008
Springer
14 years 11 months ago
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
15 years 2 months ago
A contractivity approach for probabilistic bisimulations of diffusion processes
— This work is concerned with the problem of characterizing and computing probabilistic bisimulations of diffusion processes. A probabilistic bisimulation relation between two su...
Alessandro Abate
ICIP
2003
IEEE
15 years 11 months ago
Estimation error bounds for denoising by sparse approximation
Alyson K. Fletcher, Kannan Ramchandran