Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Mohri, Mehryar"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Domain adaptation and sample bias correction theory and algorithm for regression
Corinna Cortes
,
Mehryar Mohri
Theoretical Computer Science
519
, 2014, pp. 103-126
On the disambiguation of finite automata and functional transducers
Mehryar Mohri
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 847-862
A dual coordinate descent algorithm for SVMs combined with rational kernels
Cyril Allauzen
,
Corinna Cortes
,
Mehryar Mohri
International Journal of Foundations of Computer Science
22
(8), 2011, pp. 1761-1779
General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers
Cyril Allauzen
,
Mehryar Mohri
,
Ashish Rastogi
International Journal of Foundations of Computer Science
22
(4), 2011, pp. 883-904
N
-way composition of weighted finite-state transducers
Cyril Allauzen
,
Mehryar Mohri
International Journal of Foundations of Computer Science
20
(4), 2009, pp. 613-627
General suffix automaton construction algorithm and space bounds
Mehryar Mohri
,
Pedro Moreno
,
Eugene Weinstein
Theoretical Computer Science
410
(37), 2009, pp. 3553-3562
On the computation of the relative entropy of probabilistic automata
Corinna Cortes
,
Mehryar Mohri
,
Ashish Rastogi
,
Michael Riley
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 219-242
Kernel methods for learning languages
Leonid (Aryeh) Kontorovich
,
Corinna Cortes
,
Mehryar Mohri
Theoretical Computer Science
405
(3), 2008, pp. 223-236
L_p
distance and equivalence of probabilistic automata
Corinna Cortes
,
Mehryar Mohri
,
Ashish Rastogi
International Journal of Foundations of Computer Science
18
(4), 2007, pp. 761-779
A unified construction of the Glushkov, Follow, and Antimirov automata
Cyril Allauzen
,
Mehryar Mohri
Lecture Notes in Computer Science
4162
, 2006, pp. 110-121
The design principles and algorithms of a weighted grammar library
Cyril Allauzen
,
Mehryar Mohri
,
Brian Roark
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 403-421
An optimal pre-determinization algorithm for weighted transducers
Cyril Allauzen
,
Mehryar Mohri
Theoretical Computer Science
328
(1-2), 2004, pp. 3-18
Finitely subsequential transducers
Cyril Allauzen
,
Mehryar Mohri
International Journal of Foundations of Computer Science
14
(6), 2003, pp. 983-994
Edit-distance of weighted automata: General definitions and algorithms
Mehryar Mohri
International Journal of Foundations of Computer Science
14
(6), 2003, pp. 957-982
Generic
\epsilon
-removal and input
\epsilon
-normalization algorithms for weighted transducers
Mehryar Mohri
International Journal of Foundations of Computer Science
13
(1), 2002, pp. 129-143
The design principles of a weighted finite-state transducer library
Mehryar Mohri
,
Fernando Pereira
,
Michael Riley
Theoretical Computer Science
231
(1), 2000, pp. 17-32
Minimization algorithms for sequential transducers
Mehryar Mohri
Theoretical Computer Science
234
(1-2), 2000, pp. 177-201
Matching patterns of an automaton
Mehryar Mohri
Lecture Notes in Computer Science
937
, 1995, pp. 286-297
Minimization of sequential transducers
Mehryar Mohri
Lecture Notes in Computer Science
807
, 1994, pp. 151-163