Sciweavers

985 search results - page 115 / 197
» Piercing Convex Sets
Sort
View
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
15 years 10 months ago
Thoughts on solution concepts
This paper explores connections between Ficici’s notion of solution concept and order theory. Ficici postulates that algorithms should ascend an order called weak preference; th...
Anthony Bucci, Jordan B. Pollack
VISUALIZATION
1997
IEEE
15 years 8 months ago
The VSBUFFER: visibility ordering of unstructured volume primitives by polygon drawing
Different techniques have been proposed for rendering volumetric scalar data sets. Usually these approaches are focusing on orthogonal cartesian grids, but in the last years resea...
Rüdiger Westermann, Thomas Ertl
CONCUR
1993
Springer
15 years 8 months ago
Loop Parallelization in the Polytope Model
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...
Christian Lengauer
FOCS
1992
IEEE
15 years 8 months ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Sivan Toledo
ECML
2006
Springer
15 years 8 months ago
The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
Alexander N. Dolia, Tijl De Bie, Christopher J. Ha...