256 search results - page 48 / 52 » Sparse random graphs with clustering |
102
click to vote
ADHOCNOW
2007
Springer
15 years 8 months ago
2007
Springer
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
130
Voted
DAS
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we present a novel graph-based method for extracting handwritten text lines in monochromatic Arabic document images. Our approach consists of two steps Coarse text ...
123
Voted
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
111
Voted
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Recently, cellular phone networks have begun allowing third-party applications to run over certain open-API phone operating systems such as Windows Mobile, Iphone and Go...
INFOCOM
2010
IEEE
15 years 9 days ago
2010
IEEE
—There exists a certain level of ambiguity regarding whether network coding can further improve download performance in P2P content distribution systems, as compared to commonly ...