Sciweavers

5608 search results - page 232 / 1122
» On the Theory of Matchgate Computations
Sort
View
LICS
2007
IEEE
16 years 27 days ago
Principles of Superdeduction
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
Paul Brauner, Clément Houtmann, Claude Kirc...
FCSC
2010
92views more  FCSC 2010»
15 years 5 months ago
TRainbow: a new trusted virtual machine based platform
Currently, with the evolution of virtualization technology, cloud computing mode has become more and more popular. However, people still concern the issues of the runtime integrity...
Yuzhong Sun, Haifeng Fang, Ying Song, Lei Du, Kai ...
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
15 years 5 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
MOC
2000
137views more  MOC 2000»
15 years 6 months ago
The apolar bilinear form in geometric modeling
Some recent methods of Computer Aided Geometric Design are related to the apolar bilinear form, an inner product on the space of homogeneous multivariate polynomials of a fixed deg...
Gert Vegter
GC
2010
Springer
15 years 5 months ago
Intriguing Sets of Vertices of Regular Graphs
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
Bart De Bruyn, Hiroshi Suzuki