Sciweavers

790 search results - page 151 / 158
» Subexponential Parameterized Algorithms
Sort
View
PG
1997
IEEE
15 years 4 months ago
Rendering of spherical light fields
A plenoptic function is a parameterized function describing the flow of light in space, and has served as a key idea in building some of the recent image-based rendering systems....
Insung Ihm, Sanghoon Park, Rae Kyoung Lee
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 4 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 1 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
VMV
2003
174views Visualization» more  VMV 2003»
15 years 1 months ago
Interactive Visualization of Large Finite Element Models
198 Triangles Std. Wire Frame 2 Triangles 32×32 Texture Finite element models used in crash worthiness simulations now contain more than one million mostly quadrilateral elements...
Dirc Rose, Thomas Ertl
CGF
2006
183views more  CGF 2006»
14 years 12 months ago
Data-driven Local Coordinate Systems for Image-Based Rendering
Image-based representations of an object profit from known geometry. The more accurate this geometry is known, the better corresponding pixels in the different images can be align...
Gero Müller, Ralf Sarlette, Reinhard Klein