Sciweavers

227 search results - page 26 / 46
» Linearly Parameterized Bandits
Sort
View
ICALP
2007
Springer
14 years 1 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
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
13 years 9 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
CGF
2008
87views more  CGF 2008»
13 years 9 months ago
Conformal Flattening by Curvature Prescription and Metric Scaling
We present an efficient method to conformally parameterize 3D mesh data sets to the plane. The idea behind our method is to concentrate all the 3D curvature at a small number of s...
Mirela Ben-Chen, Craig Gotsman, Guy Bunin
FAC
2008
139views more  FAC 2008»
13 years 9 months ago
Network invariants for real-time systems
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...
Olga Grinchtein, Martin Leucker
COMPUTING
2007
126views more  COMPUTING 2007»
13 years 9 months ago
An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical si...
Matthew Fisher, Boris Springborn, Peter Schrö...