625 search results - page 92 / 125 » Approximating Travel Times Using Opportunistic Networking |
134
click to vote
KDD
2008
ACM
16 years 2 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
141
click to vote
WCNC
2008
IEEE
15 years 8 months ago
2008
IEEE
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
TMC
2011
14 years 9 months ago
2011
—We investigate location distinction, the ability of a receiver to determine when a transmitter has changed location, which has application for energy conservation in wireless se...
110
click to vote
GLOBECOM
2010
IEEE
14 years 12 months ago
2010
IEEE
Network equipments generate an overwhelming number of reports and alarms every day, but only a small fraction of these alarms require the intervention of network operators. Our goa...
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...