1949 search results - page 377 / 390 » Random graphs on surfaces |
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
EDBT
2010
ACM
14 years 2 months ago
2010
ACM
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...