Sciweavers

1503 search results - page 97 / 301
» Self-optimizing distributed trees
Sort
View
ICML
2003
IEEE
14 years 10 months ago
Tractable Bayesian Learning of Tree Augmented Naive Bayes Models
Bayesian classifiers such as Naive Bayes or Tree Augmented Naive Bayes (TAN) have shown excellent performance given their simplicity and heavy underlying independence assumptions....
Jesús Cerquides, Ramon López de M&aa...
AAECC
2009
Springer
150views Algorithms» more  AAECC 2009»
14 years 4 months ago
Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new searc...
Víctor Álvarez, José Á...
EUROPAR
2004
Springer
14 years 3 months ago
Near-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
Costas Busch, Malik Magdon-Ismail, Marios Mavronic...
QOFIS
2004
Springer
14 years 3 months ago
MULTI+: Building Topology-Aware Overlay Multicast Trees
TOPLUS is a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. In this paper we present MULT...
Luis Garcés-Erice, Ernst W. Biersack, Pasca...
ISAAC
2003
Springer
125views Algorithms» more  ISAAC 2003»
14 years 3 months ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...