Sciweavers

2601 search results - page 402 / 521
» A Point in Many Triangles
Sort
View
COMPGEOM
2003
ACM
15 years 11 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
ICARCV
2002
IEEE
166views Robotics» more  ICARCV 2002»
15 years 11 months ago
Similarity measure determination from NURBS-warping method
With the advances in digital imagery, large accessible data storage, internet repositories, and image applications, information conveyed through images is gaining in importance. T...
Kim Meng Liang, Mandava Rajeswari, Bee Ee Khoo
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 11 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
ICA3PP
2010
Springer
15 years 11 months ago
Modular Resultant Algorithm for Graphics Processors
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
Pavel Emeliyanenko
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
15 years 11 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun