Sciweavers

1639 search results - page 289 / 328
» Degree-constrained network flows
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 10 months ago
Influence and Passivity in Social Media
The ever-increasing amount of information flowing through Social Media forces the members of these networks to compete for attention and influence by relying on other people to sp...
Daniel M. Romero, Wojciech Galuba, Sitaram Asur, B...
AUTOMATICA
2006
84views more  AUTOMATICA 2006»
13 years 10 months ago
Optimal control of LTI systems over unreliable communication links
In this paper, optimal control of linear time-invariant (LTI) systems over unreliable communication links is studied. The motivation of the problem comes from growing applications...
Orhan C. Imer, Serdar Yüksel, Tamer Basar
NN
2006
Springer
114views Neural Networks» more  NN 2006»
13 years 9 months ago
Modular learning models in forecasting natural phenomena
Modular model is a particular type of committee machine and is comprised of a set of specialized (local) models each of which is responsible for a particular region of the input s...
Dimitri P. Solomatine, Michael Baskara L. A. Siek
SIGMETRICS
2008
ACM
13 years 9 months ago
Long range mutual information
Network traffic modeling generally views traffic as a superposition of flows that creates a timeseries of volume counts (e.g. of bytes or packets). What is omitted from this view ...
Nahur Fonseca, Mark Crovella, Kavé Salamati...
TON
2008
125views more  TON 2008»
13 years 9 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni