Sciweavers

5608 search results - page 199 / 1122
» On the Theory of Matchgate Computations
Sort
View
118
Voted
SIGACT
2008
103views more  SIGACT 2008»
15 years 1 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke
112
Voted
RTA
1995
Springer
15 years 5 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
109
Voted
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
15 years 7 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
COMGEO
1999
ACM
15 years 1 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland
SAC
2008
ACM
15 years 1 months ago
Spatial vagueness and imprecision in databases
The impossibility of current spatial database systems and GIS to handle spatial vagueness and imprecision has been recognized as an important problem in the spatial database domai...
Alejandro Pauly, Markus Schneider