683 search results - page 102 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
CPM
2004
Springer
13 years 11 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
PSIVT
2007
Springer
14 years 1 months ago
2007
Springer
This paper considers the problem of Bayesian inference in dynamical models with time-varying dimension. These models have been studied in the context of multiple target tracking pr...
ATVA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
ARTMED
1999
13 years 7 months ago
1999
The process of reprogramming a cardiac pacemaker can be described in terms similar to those used for describing diagnostic problem solving. In this paper, the process of reprogram...
FCCM
2004
IEEE
13 years 11 months ago
2004
IEEE
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit changing needs of a computation during run time. The increasing...