2421 search results - page 189 / 485 » Approximate Flow-Aware Networking |
111
Voted
ANOR
2008
15 years 3 months ago
2008
We study a single-router Network-on-Chip modelled as a tandem queueing network. The first node is a geoK /D/1 queue (K fixed) representing a network interface, and the second node...
160
click to vote
DATAMINE
2010
15 years 3 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
227
Voted
GIS
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
144
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
126
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...