5608 search results - page 940 / 1122 » On the Theory of Matchgate Computations |
101
Voted
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
124
Voted
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
COCO
2008
Springer
15 years 3 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
153
click to vote
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
111
click to vote
DIALM
2008
ACM
15 years 3 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...