Sciweavers

785 search results - page 105 / 157
» Binary Join Trees
Sort
View
DAGM
2005
Springer
15 years 3 months ago
A Method for Fast Search of Variable Regions on Dynamic 3D Point Clouds
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...
Eric Wahl, Gerd Hirzinger
ISAAC
2003
Springer
70views Algorithms» more  ISAAC 2003»
15 years 3 months ago
Settling the Intractability of Multiple Alignment
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
Isaac Elias
CAV
1999
Springer
104views Hardware» more  CAV 1999»
15 years 2 months ago
On the Representation of Probabilities over Structured Domains
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
Marius Bozga, Oded Maler
AADEBUG
1997
Springer
15 years 1 months ago
Assertions for Dynamic Shape Analysis of List Data Structures
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...
Mikhail Auguston, Miu Har Hon
CALCO
2007
Springer
129views Mathematics» more  CALCO 2007»
15 years 1 months ago
CIRC : A Circular Coinductive Prover
Abstract. CIRC is an automated circular coinductive prover implemented as an extension of Maude. The circular coinductive technique that forms the core of CIRC is discussed, togeth...
Dorel Lucanu, Grigore Rosu