8699 search results - page 1488 / 1740 » Elements of the Theory of Computation |
197
click to vote
COMPGEOM
2005
ACM
15 years 8 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...
168
click to vote
COCO
2008
Springer
15 years 8 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...
207
click to vote
COMPGEOM
2008
ACM
15 years 8 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 ...
179
click to vote
DIALM
2008
ACM
15 years 8 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 ...
199
click to vote
DIMEA
2008
15 years 8 months ago
2008
Can Augmented Reality (AR) techniques inform the design and implementation of a mobile multimedia guide for the museum setting? Drawing from our experience both on previous mobile...