221 search results - page 34 / 45 » On Approximating the Radii of Point Sets in High Dimensions |
64
Voted
WACV
2002
IEEE
15 years 3 months ago
2002
IEEE
We present a method for estimating eye gaze direction, which represents a departure from conventional eye gaze estimation methods, the majority of which are based on tracking spec...
117
Voted
WG
2010
Springer
14 years 8 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
102
Voted
COMGEO
2008
ACM
14 years 10 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
COMPGEOM
2006
ACM
15 years 4 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
76
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—In this paper, we present MobTorrent, an ondemand, user-driven framework designed for vehicles which have intermittent high speed access to roadside WiFi access points (...