2398 search results - page 345 / 480 » Constraint Programming and Graph Algorithms |
140
Voted
CAEPIA
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
139
click to vote
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper a novel approach for semi-supervised hyperspectral unmixing is presented. First, it is shown that this problem inherently accepts a sparse solution. Then, based on t...
147
click to vote
TCS
2008
15 years 4 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
165
click to vote
AUTOMATICA
2010
15 years 3 months ago
2010
Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model Predictive ...
160
click to vote
PLDI
2010
ACM
16 years 2 months ago
2010
ACM
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...