Sciweavers

10608 search results - page 420 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
TSP
2008
98views more  TSP 2008»
15 years 4 months ago
Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking
This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by ...
Roland Badeau, Gaël Richard, Bertrand David
CG
1999
Springer
15 years 4 months ago
A visibility algorithm for hybrid geometry- and image-based modeling and rendering
Hybrid geometry- and image-based modeling and rendering systems use photographs taken of a real-world environment and mapped onto the surfaces of a 3D model to achieve photorealis...
Thomas A. Funkhouser
JAIR
2010
153views more  JAIR 2010»
15 years 2 months ago
Algorithms for Closed Under Rational Behavior (CURB) Sets
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...
Michael Benisch, George B. Davis, Tuomas Sandholm
JPDC
2010
65views more  JPDC 2010»
15 years 2 months ago
Combining shared-coin algorithms
This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Brac...
James Aspnes, Hagit Attiya, Keren Censor
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
15 years 2 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...