Sciweavers

2863 search results - page 156 / 573
» Constructing minimum-interference networks
Sort
View
INFOCOM
1995
IEEE
15 years 7 months ago
A Fast Bypass Algorithm for High-Speed Networks
In this work we suggest an algorithm that increases the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the rout...
Israel Cidon, Raphael Rom, Yuval Shavitt
UAI
2008
15 years 4 months ago
Explanation Trees for Causal Bayesian Networks
Bayesian networks can be used to extract explanations about the observed state of a subset of variables. In this paper, we explicate the desiderata of an explanation and confront ...
Ulf H. Nielsen, Jean-Philippe Pellet, André...
ESANN
2006
15 years 4 months ago
Rotation-based ensembles of RBF networks
Abstract. Ensemble methods allow to improve the accuracy of classification methods. This work considers the application of one of these methods, named Rotation-based, when the clas...
Juan José Rodríguez, Jesús Ma...
110
Voted
IJCAI
2003
15 years 4 months ago
Data Clustering: Principal Components, Hopfield and Self-Aggregation Networks
We present a coherent framework for data clustering. Starting with a Hopfield network, we show the solutions for several well-motivated clustering objective functions are principa...
Chris H. Q. Ding
IPCO
1993
138views Optimization» more  IPCO 1993»
15 years 4 months ago
An efficient approximation algorithm for the survivable network design problem
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
Harold N. Gabow, Michel X. Goemans, David P. Willi...