Sciweavers

14403 search results - page 6 / 2881
» Dynamical Systems Trees
Sort
View
DSN
2007
IEEE
14 years 4 months ago
Dynamic Fault Tree Analysis Using Input/Output Interactive Markov Chains
Dynamic Fault Trees (DFT) extend standard fault trees by allowing the modeling of complex system components’ behaviors and interactions. Being a high level model and easy to use...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
APWEB
2006
Springer
14 years 1 months ago
Efficient Dynamic Traffic Navigation with Hierarchical Aggregation Tree
Nowadays, the rapid advances in wireless communications, positioning techniques and mobile devices enable location based service such as dynamic traffic navigation. Yet, it is a ch...
Yun Bai, Yanyan Guo, Xiaofeng Meng, Tao Wan, Karin...
HIPEAC
2005
Springer
14 years 3 months ago
Dynamic Evolution of Congestion Trees: Analysis and Impact on Switch Architecture
Abstract. Designers of large parallel computers and clusters are becoming increasingly concerned with the cost and power consumption of the interconnection network. A simple way to...
Pedro Javier García, Jose Flich, José...
COCOON
1998
Springer
14 years 2 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
CVPR
2005
IEEE
14 years 11 months ago
Stereo Correspondence by Dynamic Programming on a Tree
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...
Olga Veksler