1995 search results - page 186 / 399 » What's the Problem |
182
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
167
click to vote
SODA
2010
ACM
15 years 2 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
146
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in computer vision. It has been applied to a wide range of segmentation tasks with great success. A...
126
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
d Abstract] Shai Halevi Robert Krauthgamer Eyal Kushilevitz Kobbi Nissim ? The notion of private approximation was introduced recently by Feigenbaum, Fong, Strauss and Wright. Inf...
118
Voted
ECSQARU
2009
Springer
15 years 11 months ago
2009
Springer
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...