4843 search results - page 763 / 969 » The Shortcut Problem - Complexity and Approximation |
138
click to vote
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
143
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
130
Voted
EMMCVPR
1999
Springer
15 years 7 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
132
Voted
ICDM
2007
IEEE
15 years 7 months ago
2007
IEEE
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
120
click to vote
BIRD
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Gaussian graphical models are widely used to tackle the important and challenging problem of inferring genetic regulatory networks from expression data. These models have...