Sciweavers

1064 search results - page 90 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
JMLR
2006
175views more  JMLR 2006»
15 years 4 months ago
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
Matthias Heiler, Christoph Schnörr
MOR
2008
169views more  MOR 2008»
15 years 4 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
DATESO
2007
157views Database» more  DATESO 2007»
15 years 5 months ago
Index-Based Approach to Similarity Search in Protein and Nucleotide Databases
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
David Hoksza, Tomás Skopal
PAMI
2007
176views more  PAMI 2007»
15 years 3 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
ALGORITHMICA
2011
14 years 11 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal