1064 search results - page 117 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
134
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...
145
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
131
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
Similarity matrices generated from many applications may not be positive semidefinite, and hence can't fit into the kernel machine framework. In this paper, we study the prob...
177
click to vote
Publication
Most conventional SFS (shape from shading) algorithms have been developed under three basic assumptions on surface properties and imaging geometry to simplify the problem, namely, ...
135
click to vote
CAV
2004
Springer
15 years 8 months ago
2004
Springer
Model checking algorithms can report a property as being true for reasons that may be considered vacuous. Current algorithms for detecting vacuity require either checking a quadrat...