994 search results - page 33 / 199 » Custom Computing Machines for the Set Covering Problem |
138
Voted
SIAMCOMP
1998
15 years 14 days ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
124
click to vote
MOR
2008
15 years 23 days ago
2008
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...
91
Voted
ISVC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...
83
Voted
ICML
2000
IEEE
16 years 1 months ago
2000
IEEE
We introduce an expandable Bayesian network (EBN) to handle the combination of diverse multiple homogeneous evidence sets. An EBN is an augmented Bayesian network which instantiat...
115
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...