Sciweavers

8413 search results - page 73 / 1683
» Ordering Problem Subgoals
Sort
View
ICDAR
2005
IEEE
14 years 1 months ago
Optimized XY-Cut for Determining a Page Reading Order
In this paper, we propose a fast method for determining the human reading order of the layout elements of a document page. The proposal includes a computationally tractable optimi...
Jean-Luc Meunier
MOR
2006
80views more  MOR 2006»
13 years 8 months ago
The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implic
For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equival...
Defeng Sun
ALDT
2009
Springer
144views Algorithms» more  ALDT 2009»
14 years 2 months ago
Aggregating Interval Orders by Propositional Optimization
Aggregating preferences for finding a consensus between several agents is an important issue in many fields, like economics, decision theory and artificial intelligence. In this...
Daniel Le Berre, Pierre Marquis, Meltem Özt&u...
PARA
2004
Springer
14 years 1 months ago
A Model-Order Reduction Technique for Low Rank Rational Perturbations of Linear Eigenproblems
Large and sparse rational eigenproblems where the rational term is of low rank k arise in vibrations of fluid–solid structures and of plates with elastically attached loads. Exp...
Frank Blömeling, Heinrich Voss
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 8 months ago
The Complexity of Games on Higher Order Pushdown Automata
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
Thierry Cachat, Igor Walukiewicz