2421 search results - page 198 / 485 » Approximate Flow-Aware Networking |
129
Voted
IJAHUC
2008
15 years 3 months ago
2008
: Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane R2 distributed randomly with density given by a Gaussian d...
240
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
151
Voted
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...
143
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
141
Voted
WCNC
2010
IEEE
15 years 7 months ago
2010
IEEE
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...