1604 search results - page 148 / 321 » Regularization on Discrete Spaces |
130
click to vote
COMPGEOM
1990
ACM
15 years 7 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
106
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
160
Voted
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
139
Voted
DEXA
2008
Springer
15 years 5 months ago
2008
Springer
In this research, we propose to use the discrete cosine transform to approximate the cumulative distributions of data cube cells' values. The cosine transform is known to have...
120
Voted
FMSB
2008
15 years 5 months ago
2008
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed auThis technique refines commonly-used ...