123 search results - page 23 / 25 » The minimum Manhattan network problem: Approximations and ex... |
STACS
2004
Springer
14 years 21 days ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
SIROCCO
2010
13 years 8 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
GSN
2009
Springer
13 years 11 months ago
2009
Springer
We envision participatory texture documentation (PTD) as a process in which a group of participants (dedicated individuals and/or general public) with camera-equipped mobile phones...
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
ICCAD
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— Power consumption has become a crucial problem in modern circuit design. Multiple Supply Voltage (MSV) design is introduced to provide higher flexibility in controllin...