Sciweavers

3604 search results - page 64 / 721
» All Common Subsequences
Sort
View
TCS
2008
14 years 11 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
EKAW
2004
Springer
15 years 5 months ago
Designing a Procedure for the Acquisition of Probability Constraints for Bayesian Networks
Among the various tasks involved in building a Bayesian network for a real-life application, the task of eliciting all probabilities required is generally considered the most daunt...
Eveline M. Helsper, Linda C. van der Gaag, Floris ...
ECCC
2008
117views more  ECCC 2008»
14 years 12 months ago
The complexity of learning SUBSEQ(A)
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
Stephen A. Fenner, William I. Gasarch, Brian Posto...
CORR
2007
Springer
76views Education» more  CORR 2007»
14 years 11 months ago
Power Optimal Scheduling for Guaranteed Throughput in Multi-access Fading Channels
Abstract— A power optimal scheduling algorithm that guarantees desired throughput and bounded delay to each user is developed for fading multi-access multi-band channels that can...
Prasanna Chaporkar, Kimmo Kansanen, Ralf R. Mü...
CSDA
2007
58views more  CSDA 2007»
14 years 11 months ago
A unifying model involving a categorical and/or dimensional reduction for multimode data
A unifying model is presented that implies a categorical and/or dimensional reduction of one or several modes of a multiway data set. The model encompasses a broad range of (exist...
Iven Van Mechelen, Jan Schepers