5785 search results - page 203 / 1157 » Approximability of Probability Distributions |
156
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
145
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
132
Voted
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
150
click to vote
ICCV
1999
IEEE
16 years 5 months ago
1999
IEEE
This paper describes a new method for estimating the illumination distribution of a real scene from a radiance distribution inside shadows cast by an object in the scene. First, t...
156
click to vote
ICCV
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper describes a new method for estimating the illumination distribution of a real scene from a radiance distribution inside shadows cast by an object in the scene. First, t...