2638 search results - page 91 / 528 » Random Geometric Complexes |
228
click to vote
ICDE
1999
IEEE
16 years 5 months ago
1999
IEEE
In this paper we study the node distribution of an Rtree storing region data, like for instance islands, lakes or human-inhabited areas. We will show that real region datasets are...
119
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
126
click to vote
TOG
2002
15 years 4 months ago
2002
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
138
click to vote
ICIP
1998
IEEE
16 years 6 months ago
1998
IEEE
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
133
click to vote
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...