Sciweavers

800 search results - page 128 / 160
» On the Complexity of Parity Games
Sort
View
APAL
2008
84views more  APAL 2008»
13 years 9 months ago
Resolution over linear equations and multilinear proofs
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
Ran Raz, Iddo Tzameret
AMAI
2006
Springer
13 years 9 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
TCSV
2008
152views more  TCSV 2008»
13 years 9 months ago
Animation Key-Frame Extraction and Simplification Using Deformation Analysis
Three-dimensional animating meshes have been widely used in the computer graphics and video game industries. Reducing the animating mesh complexity is a common way of overcoming th...
Tong-Yee Lee, Chao-Hung Lin, Yu-Shuen Wang, Tai-Gu...
TKDE
2008
128views more  TKDE 2008»
13 years 9 months ago
Mixed-Drove Spatiotemporal Co-Occurrence Pattern Mining
Mixed-drove spatiotemporal co-occurrence patterns (MDCOPs) represent subsets of two or more different object-types whose instances are often located in spatial and temporal proximi...
Mete Celik, Shashi Shekhar, James P. Rogers, James...
TOG
2008
136views more  TOG 2008»
13 years 9 months ago
Adaptive cutaways for comprehensible rendering of polygonal scenes
In 3D renderings of complex scenes, objects of interest may be occluded by those of secondary importance. Cutaway renderings address this problem by omitting portions of secondary...
Michael Burns, Adam Finkelstein