100 search results - page 9 / 20 » A simple entropy-based algorithm for planar point location |
COMPGEOM
1994
ACM
14 years 2 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
CVPR
2011
IEEE
13 years 7 months ago
2011
IEEE
Traditional computer vision and machine learning algorithms have been largely studied in a centralized setting, where all the processing is performed at a single central location....
SIGMETRICS
2010
ACM
14 years 3 months ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
FAW
2008
Springer
14 years 16 days ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
ICDT
2011
ACM
13 years 2 months ago
2011
ACM
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...