Sciweavers

450 search results - page 82 / 90
» Quadrangulations of Planar Sets
Sort
View
KES
2005
Springer
14 years 2 months ago
Ontology Modeling and Storage System for Robot Context Understanding
Abstract. A mobile robot that interacts with its environment needs a machineunderstandable representation of objects and their usages. We present an ontology of objects, with gener...
Eric Wang, Yong Se Kim, Hak Soo Kim, Jin Hyun Son,...
SODA
2007
ACM
123views Algorithms» more  SODA 2007»
13 years 10 months ago
Region-fault tolerant geometric spanners
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 1 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
WADS
2009
Springer
281views Algorithms» more  WADS 2009»
14 years 3 months ago
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
Krishnam Raju Jampani, Anna Lubiw
WADS
1993
Springer
110views Algorithms» more  WADS 1993»
14 years 1 months ago
A Dynamic Separator Algorithm
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
Deganit Armon, John H. Reif