47 search results - page 5 / 10 » Learning a Subclass of Regular Patterns in Polynomial Time |
IEICET
2008
14 years 11 months ago
2008
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
A major limitation of Brain-Computer Interfaces (BCI) is their long calibration time, as much data from the user must be collected in order to tune the BCI for this target user. I...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
—While medical imaging typically provides massive amounts of data, the extraction of relevant information for predictive diagnosis remains a difficult challenge. Functional MRI ...
CSL
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
115
click to vote
CPM
2009
Springer
15 years 5 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...