Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Mehryar Mohri

Mehryar Mohri is a professor of computer science at the Courant Institute of Mathematical Sciences at New York University known for his work in… Expand
Wikipedia

Related topics

Related topics

9 relations
Automata theoryComputational biologyComputer scienceJournal of Automata, Languages and Combinatorics
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Stability Bounds for Stationary φ-mixing and β-mixing Processes
Most generalization bounds in learning theory are based on some measure of the complexity of the hypothesis class used… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
On sampling-based approximate spectral decomposition
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Rational Kernels: Theory and Algorithms
Many classification algorithms were originally designed for fixed-size vectors. Recent applications in text and speech processing… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Optimising area under the ROC curve using gradient descent
This paper introduces RankOpt, a linear binary classifier which optimises the area under the ROC curve (the AUC). Unlike standard… Expand
  • figure 1
  • figure 2
Is this relevant?
2004
2004
FSA: An Efficient and Flexible C++ Toolkit for Finite State Automata Using On-Demand Computation
In this paper we present the RWTH FSA toolkit --- an efficient implementation of algorithms for creating and manipulating… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Precise Analysis of String Expressions
We perform static analysis of Java programs to answer a simple question: which values may occur as results of string expressions… Expand
Is this relevant?
1999
1999
Network optimizations for large-vocabulary speech recognition
The redundancy and the size of networks in large-vocabulary speech recognition systems can have a critical effect on their… Expand
Is this relevant?
1999
1999
A progressive refinement approach to spatial data mining
The goal of this thesis is to analyze methods for mining of spatial data, and to determine environments in which efficient… Expand
  • figure 2.7
  • figure 2.8
  • figure 3.4
  • figure 4.5
  • figure 6.2
Is this relevant?
Highly Cited
1996
Highly Cited
1996
An Efficient Compiler for Weighted Rewrite Rules
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE