Sciweavers

290 search results - page 50 / 58
» Local Partitioning for Directed Graphs Using PageRank
Sort
View
GLOBECOM
2009
IEEE
15 years 4 months ago
From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks
—Ethernet is widely used in Local Area Networks (LANs) due to its simplicity and cost effectiveness. Today, a great deal of effort is being devoted to extending Ethernet capabili...
Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker
ICML
2004
IEEE
15 years 10 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
KBSE
2007
IEEE
15 years 3 months ago
Context-aware statistical debugging: from bug predictors to faulty control flow paths
Effective bug localization is important for realizing automated debugging. One attractive approach is to apply statistical techniques on a collection of evaluation profiles of pr...
Lingxiao Jiang, Zhendong Su
79
Voted
ICC
2008
IEEE
153views Communications» more  ICC 2008»
15 years 4 months ago
MARIA: Interference-Aware Admission Control and QoS Routing in Wireless Mesh Networks
Abstract— Interference among concurrent transmissions complicates QoS provisioning for multimedia applications in wireless mesh networks. In this paper we propose MARIA (Mesh Adm...
Xiaolin Cheng, Prasant Mohapatra, Sung-Ju Lee, Suj...
CORR
2010
Springer
69views Education» more  CORR 2010»
14 years 9 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...