Sciweavers

60 search results - page 10 / 12
» On the Power of Unambiguity in Alternating Machines
Sort
View
COLING
1992
13 years 8 months ago
Compiling and Using Finite-State Syntactic Rules
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
Kimmo Koskenniemi, Pasi Tapanainen, Atro Voutilain...
PR
2006
152views more  PR 2006»
13 years 7 months ago
Edit distance-based kernel functions for structural pattern classification
A common approach in structural pattern classification is to define a dissimilarity measure on patterns and apply a distance-based nearest-neighbor classifier. In this paper, we i...
Michel Neuhaus, Horst Bunke
ICMCS
2005
IEEE
284views Multimedia» more  ICMCS 2005»
14 years 29 days ago
Conditionally Positive Definite Kernels for SVM Based Image Recognition
Kernel based methods such as Support Vector Machine (SVM) have provided successful tools for solving many recognition problems. One of the reason of this success is the use of ker...
Sabri Boughorbel, Jean-Philippe Tarel, Nozha Bouje...
RECOMB
2005
Springer
14 years 7 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
EACL
1989
ACL Anthology
13 years 8 months ago
A rich environment for experimentation with unification grammars
This paper describes some of the features of a sophisticated language and environment designed for experimentation with unification-oriented linguistic descriptions. The system, w...
Rod L. Johnson, Mike Rosner