222 search results - page 3 / 45 » Locally Compact Path Spaces |
MSS
2008
IEEE
14 years 9 months ago
2008
IEEE
Maximal elements of a binary relation on compact subsets of a metric space define a choice function. An infinite extension of transitivity is necessary and sufficient for such a c...
94
Voted
TON
2010
14 years 4 months ago
2010
Routing protocols for large wireless networks must address the challenges of reliable packet delivery at increasingly large scales and with highly limited resources. Attempts to re...
PODC
2003
ACM
15 years 2 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
ICCAD
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper presents a unique approach to improve yield given a routed layout. Currently after routing has been completed and compacted, it generally proceeds to verification witho...
CIKM
2004
Springer
15 years 2 months ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...