Sciweavers

3250 search results - page 245 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICALP
2007
Springer
15 years 10 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
PODS
2010
ACM
306views Database» more  PODS 2010»
15 years 11 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
CP
2006
Springer
15 years 10 months ago
Sports League Scheduling: Enumerative Search for Prob026 from CSPLib
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...
Jean-Philippe Hamiez, Jin-Kao Hao
STOC
1990
ACM
95views Algorithms» more  STOC 1990»
15 years 10 months ago
Separators in Two and Three Dimensions
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
Gary L. Miller, William P. Thurston
ICASSP
2011
IEEE
14 years 10 months ago
Estimation and dynamic updating of time-varying signals with sparse variations
This paper presents an algorithm for an 1-regularized Kalman filter. Given observations of a discrete-time linear dynamical system with sparse errors in the state evolution, we e...
Muhammad Salman Asif, Adam Charles, Justin K. Romb...