Sciweavers

385 search results - page 16 / 77
» On higher-order perceptron algorithms
Sort
View
BIRTHDAY
2004
Springer
14 years 1 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
ENTCS
2008
140views more  ENTCS 2008»
13 years 8 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal
TSMC
2010
13 years 3 months ago
Invariant Set of Weight of Perceptron Trained by Perceptron Training Algorithm
In this paper, an invariant set of the weight of the perceptron trained by the perceptron training algorithm is defined and characterized. The dynamic range of the steady state va...
Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Herber...
ACL
2004
13 years 9 months ago
Incremental Parsing with the Perceptron Algorithm
This paper describes an incremental parsing approach where parameters are estimated using a variant of the perceptron algorithm. A beam-search algorithm is used during both traini...
Michael Collins, Brian Roark
COLT
2007
Springer
14 years 11 days ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...