Sciweavers

4110 search results - page 61 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
124
Voted
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 7 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
124
Voted
COCOON
2006
Springer
15 years 7 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
139
Voted
COCOON
2006
Springer
15 years 7 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
DISOPT
2008
89views more  DISOPT 2008»
15 years 3 months ago
A pricing problem under Monge property
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
Oktay Günlük
133
Voted
TCBB
2008
101views more  TCBB 2008»
15 years 3 months ago
The Undirected Incomplete Perfect Phylogeny Problem
The incomplete perfect phylogeny (IPP) problem and the incomplete perfect phylogeny haplotyping (IPPH) problem deal with constructing a phylogeny for a given set of haplotypes or g...
Ravi Vijaya Satya, Amar Mukherjee