1272 search results - page 96 / 255 » The Set Cover with Pairs Problem |
100
click to vote
DISOPT
2008
15 years 27 days ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
126
Voted
WABI
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
110
Voted
ICIP
1994
IEEE
15 years 5 months ago
1994
IEEE
Many multi-dimensional signal processing problems require the computation of signal gradients or directional derivatives. Traditional derivative estimates based on adjacent or cen...
126
Voted
MICCAI
2006
Springer
16 years 1 months ago
2006
Springer
Reconstruction of patient-specific 3D bone surface from 2D calibrated fluoroscopic images and a point distribution model is discussed. We present a 2D/3D reconstruction scheme comb...
111
Voted
CORR
2006
Springer
15 years 26 days ago
2006
Springer
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...