1387 search results - page 149 / 278 » Convexity in Discrete Space |
148
click to vote
JCDCG
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
179
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...
158
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
202
click to vote
SIBGRAPI
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an output-sensitive occlusion culling algorithm for densely occluded dynamic scenes where both the viewpoint and objects move arbitrarily. Our method works on a regular ...
148
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— This work is concerned with the problem of characterizing and computing probabilistic bisimulations of diffusion processes. A probabilistic bisimulation relation between two su...