Sciweavers

522 search results - page 81 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
126
Voted
SERVICES
2008
103views more  SERVICES 2008»
15 years 4 months ago
Grouping Distributed Stream Query Services by Operator Similarity and Network Locality
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...
Sangeetha Seshadri, Bhuvan Bamba, Brian F. Cooper,...
135
Voted
GI
2009
Springer
15 years 6 months ago
Parallelised Gaussian Mixture Filtering for Vehicular Traffic Flow Estimation
: Large traffic network systems require handling huge amounts of data, often distributed over a large geographical region in space and time. Centralised processing is not then the ...
Lyudmila Mihaylova, Amadou Gning, Viktor Doychinov...
117
Voted
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 8 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
128
Voted
NTMS
2009
IEEE
15 years 9 months ago
Minimizing Cost of Scalable Distributed Least Squares Localization
—Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspects of WSN research is location estimation. As a good s...
Ralf Behnke, Jakob Salzmann, Dirk Timmermann
125
Voted
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 9 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran