Sciweavers

395 search results - page 20 / 79
» Decision Problems for Convex Languages
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
SAC
2008
ACM
13 years 7 months ago
A generic XML language for characterising objects to support digital preservation
The dominance of digital objects in today's information landscape has changed the way humankind creates and exchanges information. However, it has also brought an entirely ne...
Christoph Becker, Andreas Rauber, Volker Heydegger...
ICALP
1990
Springer
13 years 11 months ago
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
David P. Dobkin, David G. Kirkpatrick
PADL
2010
Springer
14 years 4 months ago
Automating Mathematical Program Transformations
Abstract. Mathematical programs (MPs) are a class of constrained optimization problems that include linear, mixed-integer, and disjunctive programs. Strategies for solving MPs rely...
Ashish Agarwal, Sooraj Bhat, Alexander Gray, Ignac...
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 17 days ago
Simplifying XML schema: single-type approximations of regular tree languages
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
Wouter Gelade, Tomasz Idziaszek, Wim Martens, Fran...