Sciweavers

7006 search results - page 60 / 1402
» Approximation Algorithms
Sort
View
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 3 months ago
Yet another algorithm for dense max cut: go greedy
We study dense instances of MaxCut and its generalizations. Following a long list of existing, diverse and often sophisticated approximation schemes, we propose taking the na
Claire Mathieu, Warren Schudy
ECCC
2006
71views more  ECCC 2006»
15 years 2 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...
JAT
2006
64views more  JAT 2006»
15 years 2 months ago
Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...
Andreas Hofinger
WADS
2007
Springer
195views Algorithms» more  WADS 2007»
15 years 8 months ago
Approximation Algorithms for the Sex-Equal Stable Marriage Problem
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
TIFS
2008
157views more  TIFS 2008»
15 years 2 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...