Sciweavers

1477 search results - page 264 / 296
» Complexity of (iterated) dominance
Sort
View
ACL
2011
13 years 8 days ago
Using Large Monolingual and Bilingual Corpora to Improve Coordination Disambiguation
Resolving coordination ambiguity is a classic hard problem. This paper looks at coordination disambiguation in complex noun phrases (NPs). Parsers trained on the Penn Treebank are...
Shane Bergsma, David Yarowsky, Kenneth Ward Church
JOTA
2011
78views more  JOTA 2011»
12 years 11 months ago
Outer Trust-Region Method for Constrained Optimization
Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an Outer Trust-Region (OTR) modification of A is the result of ...
Ernesto G. Birgin, Emerson V. Castelani, Andr&eacu...
SIAMREV
2011
63views more  SIAMREV 2011»
12 years 11 months ago
Discrete Symbol Calculus
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space x and frequen...
Laurent Demanet, Lexing Ying
ICCV
2011
IEEE
12 years 8 months ago
Simultaneous Correspondence and Non-Rigid 3D Reconstruction of the Coronary Tree from Single X-ray Images
We present a novel approach to simultaneously reconstruct the 3D structure of a non-rigid coronary tree and estimate point correspondences between an input X-ray image and a refer...
Eduard Serradell (Institut de Robotica i Informati...
AAAI
2011
12 years 8 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter