Sciweavers

2713 search results - page 121 / 543
» Parameterized Tree Systems
Sort
View
116
Voted
IFIP
2004
Springer
15 years 9 months ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...
134
Voted
CAI
2010
Springer
14 years 10 months ago
A Comparison of Decision Tree Classifiers for Automatic Diagnosis of Speech Recognition Errors
Present speech recognition systems are becoming more complex due to technology advances, optimizations and special requirements such as small computation and memory footprints. Pro...
Milos Cernak
118
Voted
ISPDC
2006
IEEE
15 years 9 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
IPMU
2010
Springer
15 years 2 months ago
Attribute Value Selection Considering the Minimum Description Length Approach and Feature Granularity
Abstract. In this paper we introduce a new approach to automatic attribute and granularity selection for building optimum regression trees. The method is based on the minimum descr...
Kemal Ince, Frank Klawonn
127
Voted
SSS
2009
Springer
107views Control Systems» more  SSS 2009»
15 years 10 months ago
A Self-stabilizing Algorithm for Graph Searching in Trees
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
Rodica Mihai, Morten Mjelde