369 search results - page 8 / 74 » Accuracy Certificates for Computational Problems with Convex... |
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
ICCSA
2004
Springer
14 years 27 days ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
COMPGEOM
2004
ACM
14 years 28 days ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
SIAMJO
2010
13 years 2 months ago
2010
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
CORR
2011
Springer
12 years 11 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...