Sciweavers

5624 search results - page 266 / 1125
» On Conditional Covering Problem
Sort
View
CCCG
2006
15 years 8 months ago
Polygon Reconstruction from Line Cross-Sections
We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...
Gill Barequet, Craig Gotsman, Avishay Sidlesky
INLG
2010
Springer
15 years 4 months ago
Named Entity Generation Using Sampling-based Structured Prediction
The problem of Named Entity Generation is expressed as a conditional probability model over a structured domain. By defining a factor-graph model over the mentions of a text, we o...
Guillaume Bouchard
SCL
2010
105views more  SCL 2010»
15 years 1 months ago
Asymptotic approach on conjugate points for minimal time bang-bang controls
We focus on the minimal time control problem for single-input control-affine systems x = X(x) + u1Y1(x) in IRn with fixed initial and final time conditions x(0) = ^x0, x(tf ) = ^x...
C. J. Silva, Emmanuel Trélat
SIAMJO
2002
100views more  SIAMJO 2002»
15 years 6 months ago
Warm-Start Strategies in Interior-Point Methods for Linear Programming
Abstract. We study the situation in which, having solved a linear program with an interiorpoint method, we are presented with a new problem instance whose data is slightly perturbe...
E. Alper Yildirim, Stephen J. Wright
SIAMDM
2008
140views more  SIAMDM 2008»
15 years 6 months ago
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
Daniel Král, Petr Skoda