Sciweavers

17760 search results - page 3471 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Reliability in Layered Networks with Random Link Failures
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
Kayi Lee, Hyang-Won Lee, Eytan Modiano
JAIR
2010
145views more  JAIR 2010»
13 years 6 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
KDD
2010
ACM
318views Data Mining» more  KDD 2010»
13 years 6 months ago
DivRank: the interplay of prestige and diversity in information networks
Information networks are widely used to characterize the relationships between data items such as text documents. Many important retrieval and mining tasks rely on ranking the dat...
Qiaozhu Mei, Jian Guo, Dragomir R. Radev
MST
2010
111views more  MST 2010»
13 years 6 months ago
Sturmian Trees
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
Jean Berstel, Luc Boasson, Olivier Carton, Isabell...
PAMI
2010
168views more  PAMI 2010»
13 years 6 months ago
Nonnegative Least-Correlated Component Analysis for Separation of Dependent Sources by Volume Maximization
—Although significant efforts have been made in developing nonnegative blind source separation techniques, accurate separation of positive yet dependent sources remains a challen...
Fa-Yu Wang, Chong-Yung Chi, Tsung-Han Chan, Yue Wa...
« Prev « First page 3471 / 3552 Last » Next »