14850 search results - page 126 / 2970 » A Geometric Approach to Betweenness |
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
ALGOSENSORS
2004
Springer
14 years 2 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
CIKM
2005
Springer
13 years 11 months ago
2005
Springer
Inverted index structures are the mainstay of modern text retrieval systems. They can be constructed quickly using off-line mergebased methods, and provide efficient support for ...
CIMAGING
2008
13 years 10 months ago
2008
We present an algorithm to generate samples from probability distributions on the space of curves. Traditional curve evolution methods use gradient descent to find a local minimum...
AHSWN
2006
13 years 9 months ago
2006
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...