Sciweavers

2498 search results - page 27 / 500
» Data Structures with Unpredictable Timing
Sort
View
51
Voted
SODA
2004
ACM
116views Algorithms» more  SODA 2004»
14 years 11 months ago
Retroactive data structures
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
Erik D. Demaine, John Iacono, Stefan Langerman
WIA
2000
Springer
15 years 1 months ago
Generalizing the Discrete Timed Automaton
Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with va...
Oscar H. Ibarra, Jianwen Su
RSA
2006
144views more  RSA 2006»
14 years 9 months ago
Data structures with dynamical random transitions
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
Clément Dombry, Nadine Guillotin-Plantard, ...
IEEEICCI
2007
IEEE
15 years 4 months ago
Underwater surface recovery and segmentation
Abstract— The underwater environment presents many challenges for robotic sensing including highly variable lighting and the presence of dynamic objects such as fish and suspend...
Michael R. M. Jenkin, Andrew Hogue, Andrew German,...
CIBCB
2008
IEEE
15 years 4 months ago
Temporal and structural analysis of biological networks in combination with microarray data
— We introduce a graph-based relational learning approach using graph-rewriting rules for temporal and structural analysis of biological networks changing over time. The analysis...
Chang Hun You, Lawrence B. Holder, Diane J. Cook