14158 search results - page 279 / 2832 » Generalized switch-setting problems |
138
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
142
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
138
click to vote
ALGORITHMICA
2007
15 years 4 months ago
2007
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (C1S) p...
145
click to vote
AHSWN
2006
15 years 4 months ago
2006
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
152
Voted
JCO
2008
15 years 4 months ago
2008
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...