22 search results - page 1 / 5 » Approximating Largest Convex Hulls for Imprecise Points |
WAOA
2007
Springer
13 years 10 months ago
2007
Springer
ALGORITHMICA
2010
13 years 4 months ago
2010
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...
ICIP
2000
IEEE
14 years 6 months ago
2000
IEEE
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1...