Sciweavers

282 search results - page 16 / 57
» Online Learning of Approximate Dependency Parsing Algorithms
Sort
View
PAMI
2012
11 years 10 months ago
Recursive Segmentation and Recognition Templates for Image Parsing
— Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchi...
Long Zhu, Yuanhao Chen, Yuan Lin, Chenxi Lin, Alan...
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 8 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
NIPS
2008
13 years 9 months ago
An interior-point stochastic approximation method and an L1-regularized delta rule
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
Peter Carbonetto, Mark Schmidt, Nando de Freitas
SIGIR
2005
ACM
14 years 1 months ago
Question answering passage retrieval using dependency relations
State-of-the-art question answering (QA) systems employ termdensity ranking to retrieve answer passages. Such methods often retrieve incorrect passages as relationships among ques...
Hang Cui, Renxu Sun, Keya Li, Min-Yen Kan, Tat-Sen...
EMNLP
2011
12 years 7 months ago
Multi-Source Transfer of Delexicalized Dependency Parsers
We present a simple method for transferring dependency parsers from source languages with labeled training data to target languages without labeled training data. We first demons...
Ryan T. McDonald, Slav Petrov, Keith Hall