1469 search results - page 253 / 294 » Approximate polynomial decomposition |
120
click to vote
PODS
2001
ACM
16 years 18 hour ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
SAC
2010
ACM
15 years 6 months ago
2010
ACM
This work proposes and evaluates a sampling algorithm based on wavelet transforms with Coiflets basis to reduce the data sensed in wireless sensor networks applications. The Coiï...
IROS
2009
IEEE
15 years 6 months ago
2009
IEEE
— This paper describes an algorithm for estimating lane boundaries and curbs from a moving vehicle using noisy observations and a probabilistic model of curvature. The primary co...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
129
click to vote
SMA
2009
ACM
15 years 6 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...