Sciweavers

Share
COMGEO
2011
ACM
7 years 10 months ago
Physical world as an internet of things
ABSTRACT . Categories and Subject Descriptors K. Computing Milieux K.m MISCELLANEOUS General Terms Theory Keywords Cyber-physics, Internet of Things, Quantum computing Cloud Comput...
Simon Berkovich
COMGEO
2011
ACM
7 years 10 months ago
Rolling thunder
Anthony Anecito
COMGEO
2011
ACM
7 years 10 months ago
What to do with 500M location requests a day?
Skyhook Wireless provides hybrid positioning to millions of mobile devices around the world. Using an approach that integrates cell, WiFi, and GPS signals, the system services ove...
Kipp Jones, Richard Sutton
COMGEO
2011
ACM
8 years 1 months ago
Efficient on-line algorithms for Euler diagram region computation
Gennaro Cordasco, Rosario De Chiara, Andrew Fish
COMGEO
2011
ACM
8 years 2 months ago
Improved bounds for cops-and-robber pursuit
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
Laurent Alonso, Edward M. Reingold
COMGEO
2011
ACM
8 years 2 months ago
Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
J. Joseph Fowler, Michael Jünger, Stephen G. ...
COMGEO
2011
ACM
8 years 2 months ago
A computational approach to Conway's thrackle conjecture
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
Radoslav Fulek, János Pach
COMGEO
2011
ACM
8 years 2 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...
COMGEO
2011
ACM
8 years 2 months ago
Stabbers of line segments in the plane
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...
Mercè Claverol, Delia Garijo, Clara I. Grim...
COMGEO
2011
ACM
8 years 2 months ago
Covering points by disjoint boxes with outliers
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin...
books