Sciweavers

121 search results - page 18 / 25
» Visibility Representations of Complete Graphs
Sort
View
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 2 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
OOPSLA
2007
Springer
14 years 1 months ago
No ifs, ands, or buts: uncovering the simplicity of conditionals
Schematic tables are a new representation for conditionals. Roughly a cross between decision tables and data flow graphs, they represent computation and decision-making orthogona...
Jonathan Edwards
IROS
2006
IEEE
113views Robotics» more  IROS 2006»
14 years 1 months ago
A Framework for Automatic Deployment of Robots in 2D and 3D Environments
Abstract— We present a computational framework for automatic deployment of robots in 2D and 3D rectangular environments with polytopal obstacles. The results are derived for poly...
Marius Kloetzer, Calin Belta
FMCAD
2006
Springer
13 years 11 months ago
Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent yea...
Florian Pigorsch, Christoph Scholl, Stefan Disch
LICS
2009
IEEE
14 years 2 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...