Sciweavers

2899 search results - page 194 / 580
» Dynamic Trees in Practice
Sort
View
ASPDAC
2005
ACM
101views Hardware» more  ASPDAC 2005»
15 years 10 months ago
Lower bounds for dynamic BDD reordering
— In this paper we present new lower bounds on BDD size. These lower bounds are derived from more general lower bounds that recently were given in the context of exact BDD minimi...
Rüdiger Ebendt, Rolf Drechsler
WEA
2004
Springer
110views Algorithms» more  WEA 2004»
15 years 10 months ago
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
David J. Pearce, Paul H. J. Kelly
ICRA
2000
IEEE
110views Robotics» more  ICRA 2000»
15 years 9 months ago
An Implicit Time-Stepping Scheme for Rigid Body Dynamics with Coulomb Friction
In this paper a new time-stepping method for simulating systems of rigid bodies is given. Unlike methods which take an instantaneous point of view, our method is based on impulse-m...
David E. Stewart, Jeffrey C. Trinkle
VISUALIZATION
2000
IEEE
15 years 9 months ago
Fast visualization methods for comparing dynamics: a case study in combustion
Visualization can be an important tool for displaying, categorizing and digesting large quantities of inter-related information during laboratory and simulation experiments. Summa...
Kay A. Robbins, Michael Gorman
CCS
1999
ACM
15 years 9 months ago
Password Hardening Based on Keystroke Dynamics
We present a novel approach to improving the security of passwords. In our approach, the legitimate user’s typing patterns (e.g., durations of keystrokes and latencies between ke...
Fabian Monrose, Michael K. Reiter, Susanne Wetzel