1092 search results - page 150 / 219 » Convex Methods for Transduction |
JUCS
2007
14 years 9 months ago
2007
: In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic te...
AUTOMATICA
2004
14 years 9 months ago
2004
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
IVC
2002
14 years 9 months ago
2002
Object decomposition into simpler parts greatly diminishes the complexity of a recognition task. In this paper, we present a method to decompose a 3D discrete object into nearly c...
ATMOS
2010
14 years 8 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
EMNLP
2010
14 years 7 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...