6266 search results - page 30 / 1254 » New results on the computability and complexity of points - ... |
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Iris localization is an especially important step in the whole iris recognition system, for it determines the accuracy of matching partially. To improve its accuracy and efficienc...
TAPSOFT
1997
Springer
13 years 11 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
JUCS
2010
13 years 6 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
COMPGEOM
2010
ACM
14 years 19 days ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
EMO
2005
Springer
14 years 1 months ago
2005
Springer
We present a new analysis of the LebMeasure algorithm for calculating hypervolume. We prove that although it is polynomial in the number of points, LebMeasure is exponential in the...