Sciweavers

658 search results - page 91 / 132
» Lower bounds for sorting networks
Sort
View
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 7 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
13 years 5 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
WINET
2011
13 years 2 months ago
Aggregation convergecast scheduling in wireless sensor networks
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...
Baljeet Malhotra, Ioanis Nikolaidis, Mario A. Nasc...
TMC
2010
167views more  TMC 2010»
13 years 2 months ago
Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
Ryo Sugihara, Rajesh K. Gupta
WIOPT
2011
IEEE
12 years 11 months ago
Open loop optimal control of base station activation for green networks
Abstract—In recent years there has been an increasing awareness that the deployment as well as utilization of new information technology may have some negative ecological impact....
Sreenath Ramanath, Veeraruna Kavitha, Eitan Altman