Sciweavers

630 search results - page 122 / 126
» Hardness results for approximating the bandwidth
Sort
View
PODC
2005
ACM
15 years 3 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
MM
2004
ACM
167views Multimedia» more  MM 2004»
15 years 2 months ago
Learning an image manifold for retrieval
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
Xiaofei He, Wei-Ying Ma, HongJiang Zhang
CIKM
2004
Springer
15 years 2 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
107
Voted
IPSN
2004
Springer
15 years 2 months ago
The impact of spatial correlation on routing with compression in wireless sensor networks
The efficacy of data aggregation in sensor networks is a function of the degree of spatial correlation in the sensed phenomenon. While several data aggregation (i.e., routing with...
Sundeep Pattem, Bhaskar Krishnamachari, Ramesh Gov...
ICALP
2010
Springer
15 years 2 months ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...