1923 search results - page 104 / 385 » Weighted Decision Trees |
162
click to vote
SRDS
1998
IEEE
15 years 10 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
173
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
161
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract-- High-throughput microarrays inform us on different outlooks of the molecular mechanisms underlying the function of cells and organisms. While computational analysis for ...
170
click to vote
ETRICS
2006
15 years 10 months ago
2006
Abstract. Most intrusion detection systems deployed today apply misuse detection as detection procedure. Misuse detection compares the recorded audit data with predefined patterns,...
162
click to vote
FUN
2007
Springer
16 years 13 days ago
2007
Springer
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...