Sciweavers

1493 search results - page 38 / 299
» Local resilience of graphs
Sort
View
GLOBECOM
2008
IEEE
14 years 2 months ago
WONDER: A PON over a Folded Bus
— Passive Optical Networks (PONs) represent a step forward in “first mile” networks; indeed, by using optical technologies, PONs can transfer a large amount of data, and by ...
Andrea Bianco, Davide Cuda, Jorge M. Finochietto, ...
SSWMC
2004
13 years 9 months ago
Image watermarking based on scale-space representation
This paper proposes a novel method for content-based watermarking based on feature points of an image. At each feature point, watermark is embedded after affine normalization acco...
Jin S. Seo, Chang D. Yoo
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 8 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
INFOCOM
2009
IEEE
14 years 2 months ago
Sensor Network Localization Using Sensor Perturbation
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
Yuanchen Zhu, Steven J. Gortler, Dylan Thurston
LAWEB
2003
IEEE
14 years 29 days ago
Clustering the Chilean Web
We perform a clustering of the Chilean Web Graph using a local fitness measure, optimized by simulated annealing, and compare the obtained cluster distribution to that of two mod...
Satu Virtanen