Simultaneous embedding of planar graphs with few bends.
Simultaneous graph drawing: layout algorithms and visualization schemes.
Simultaneous Localization And Mapping: A feature-based probabilistic approach
This article provides an introduction to Simultaneous Localization And Mapping (SLAM), with the focus on probabilistic SLAM utilizing a feature-based description of the environment. A probabilistic formulation of the SLAM problem is introduced, and a solution based on the Extended Kalman Filter (EKF-SLAM) is shown. Important issues of convergence, consistency, observability, data association and scaling in EKF-SLAM are discussed from both theoretical and practical points of view. Major extensions...
Simultaneously good bases of a lattice and its reciprocal lattice.
Single-sweep timing simulation
Single-tape reset machines
SiPaViS -- a toolkit for scientific visualization and simulation.
Sixty years of cybernetics: cybernetics still alive
This informal essay, written on the occasion of 60th anniversary of Wienerian cybernetics, presents a series of themes and ideas that has emerged during last several decades and which have direct or indirect relationships to the principal concepts of cybernetics. Moreover, they share with original cybernetics the same transdisciplinary character.
Sixty years of cybernetics: from youthful to useful
Sixty years of cybernetics: the philosophical foundations of cybernetics
Skeletonization on quadtree represented images.
Skip lists - some results on a recent data structure.
Skip trees, an alternative data structure to skip lists in a concurrent approach
SMAL - The symbol manipulation language
Small maximal independent sets and faster exact graph coloring.
Small Scale Retrodigitization
The digitization of papers born in the print-only era is vital for the health of the mathematical record. Many large scale retrodigitization projects are underway and, at this point, probably more that half of the mathematical history has been finished. Many smaller journals and books remain to be done. This paper gives a framework within which these may also be completed. It uses the digitization of the Canadian Journal of Mathematics (53,000 pages), completed as a one-man project over a few months,...
Small stretch spanners on dynamic graphs.
Small-Dimensional Linear Programming and Convex Hulls Made Easy.
Smooth and sharp thresholds for random -XOR-CNF satisfiability
The aim of this paper is to study the threshold behavior for the satisfiability property of a random -XOR-CNF formula or equivalently for the consistency of a random Boolean linear system with variables per equation. For we show the existence of a sharp threshold for the satisfiability of a random -XOR-CNF formula, whereas there are smooth thresholds for and .
Smooth and sharp thresholds for random {k}-XOR-CNF satisfiability
The aim of this paper is to study the threshold behavior for the satisfiability property of a random k-XOR-CNF formula or equivalently for the consistency of a random Boolean linear system with k variables per equation. For k ≥ 3 we show the existence of a sharp threshold for the satisfiability of a random k-XOR-CNF formula, whereas there are smooth thresholds for k=1 and k=2.