Sciweavers

2912 search results - page 205 / 583
» Logistic Model Trees
Sort
View
CGF
2008
110views more  CGF 2008»
15 years 4 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
JUCS
2007
108views more  JUCS 2007»
15 years 4 months ago
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP)
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...
Hossein Hojjat, Hootan Nakhost, Marjan Sirjani
CORR
2004
Springer
125views Education» more  CORR 2004»
15 years 3 months ago
Traffic Accident Analysis Using Decision Trees and Neural Networks
The costs of fatalities and injuries due to traffic accident have a great impact on society. This paper presents our research to model the severity of injury resulting from traffi...
Miao M. Chong, Ajith Abraham, Marcin Paprzycki
108
Voted
DAM
2000
126views more  DAM 2000»
15 years 3 months ago
2-Medians in trees with pos/neg weights
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
Rainer E. Burkard, Eranda Çela, Helidon Dol...
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 3 months ago
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
David Peleg, Vitaly Rubinovich