Sciweavers

6943 search results - page 531 / 1389
» Representations for evolutionary algorithms
Sort
View
VVS
1995
IEEE
175views Visualization» more  VVS 1995»
15 years 10 months ago
A Lipschitz Method for Accelerated Volume Rendering
Interpolating discrete volume data into a continuous form adapts implicit surface techniques for rendering volumetric iso-surfaces. One such algorithm uses the Lipschitz condition...
Barton T. Stander, John C. Hart
NIPS
2007
15 years 8 months ago
Stable Dual Dynamic Programming
Recently, we have introduced a novel approach to dynamic programming and reinforcement learning that is based on maintaining explicit representations of stationary distributions i...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
UAI
2001
15 years 8 months ago
Graphical Models for Game Theory
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
Michael J. Kearns, Michael L. Littman, Satinder P....
ECCV
2010
Springer
15 years 7 months ago
Tensor Sparse Coding for Region Covariances
Sparse representation of signals has been the focus of much research in the recent years. A vast majority of existing algorithms deal with vectors, and higher
Ravishankar Sivalingam, Daniel Boley, Vassilios Mo...
DM
2007
106views more  DM 2007»
15 years 7 months ago
The Roberts characterization of proper and unit interval graphs
In this note, a constructive proof is given that the classes of proper interval graphs and unit interval graphs coincide, a result originally established by Fred S. Roberts. Addit...
Frédéric Gardi