Sciweavers

1508 search results - page 217 / 302
» Efficient Path Profiling
Sort
View
NETWORKING
2000
13 years 10 months ago
Computing Blocking Probabilities in Multi-class Wavelength Routing Networks
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
Sridhar Ramesh, George N. Rouskas, Harry G. Perros
AAAI
1990
13 years 10 months ago
Symbolic Probabilistic Inference in Belief Networks
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
Ross D. Shachter, Bruce D'Ambrosio, Brendan Del Fa...
DEXAW
2010
IEEE
149views Database» more  DEXAW 2010»
13 years 10 months ago
Using Progressive Filtering to Deal with Information Overload
Abstract-- In the age of Web 2.0 people organize large collections of web pages, articles, or emails in hierarchies of topics, or arrange a large body of knowledge in ontologies. T...
Andrea Addis, Giuliano Armano, Eloisa Vargiu
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 9 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 9 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal