Search Sciweavers | Sciweavers

562 search results - page 2 / 113

» Approximation algorithms and hardness of the k-route cut pro...

click to vote

SAGT
2010
Springer

160views Game Theory» more SAGT 2010»

How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?

13 years 4 months ago

Download www.csc.liv.ac.uk

The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...

Paul W. Goldberg

claim paper

Read More »

click to vote

STOC
2007
ACM

154views Algorithms» more STOC 2007»

Improved approximation for directed cut problems

14 years 6 months ago

Download www.math.tau.ac.il

Amit Agarwal, Noga Alon, Moses Charikar

claim paper

Read More »

click to vote

RSA
2008

67views more RSA 2008»

Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms

13 years 5 months ago

Download cs-www.cs.yale.edu

Petros Drineas, Ravi Kannan, Michael W. Mahoney

claim paper

Read More »

click to vote

ICCV
2005
IEEE

196views Computer Vision» more ICCV 2005»

A Unifying Approach to Hard and Probabilistic Clustering

13 years 11 months ago

Download www.cs.huji.ac.il

We derive the clustering problem from ﬁrst principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...

Ron Zass, Amnon Shashua

claim paper

Read More »

click to vote

STOC
2007
ACM

91views Algorithms» more STOC 2007»

Polynomial flow-cut gaps and hardness of directed cut problems

14 years 6 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers