Sciweavers

84 search results - page 15 / 17
» Computing Many Faces in Arrangements of Lines and Segments
Sort
View
CCCG
2010
15 years 1 months ago
Existence of zone diagrams in compact subsets of uniformly convex spaces
A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and ...
Eva Kopecká, Daniel Reem, Simeon Reich
ICTAC
2010
Springer
14 years 9 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
PPAM
2005
Springer
15 years 5 months ago
Asymmetric Scheduling and Load Balancing for Real-Time on Linux SMP
The ARTiS system, a real-time extension of the GNU/Linux scheduler dedicated to SMP (Symmetric Multi-Processors) systems is proposed. ARTiS exploits the SMP architecture to guarant...
Éric Piel, Philippe Marquet, Julien Soula, ...
VLC
2010
91views more  VLC 2010»
14 years 10 months ago
A model-based recognition engine for sketched diagrams
Many of today’s recognition approaches for hand-drawn sketches are feature-based, which is conceptually similar to the recognition of hand-written text. While very suitable for ...
Florian Brieler, Mark Minas
COMPGEOM
2010
ACM
15 years 4 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan