791 search results - page 104 / 159 » Approximating the Maximum Sharing Problem |
141
click to vote
CVPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In photometric stereo a robust method is required to deal with outliers, such as shadows and non-Lambertian reflections. In this paper we rely on a probabilistic imaging model tha...
113
click to vote
NIPS
2007
15 years 4 months ago
2007
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
133
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
118
click to vote
IWPEC
2009
Springer
15 years 9 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
104
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...