Sciweavers

829 search results - page 135 / 166
» Distance domination-critical graphs
Sort
View
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
14 years 10 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam
ICPR
2010
IEEE
14 years 9 months ago
Rectifying Non-Euclidean Similarity Data Using Ricci Flow Embedding
Similarity based pattern recognition is concerned with the analysis of patterns that are specified in terms of object dissimilarity or proximity rather than ordinal values. For man...
Weiping Xu, Edwin R. Hancock, Richard C. Wilson
CORR
2010
Springer
178views Education» more  CORR 2010»
14 years 9 months ago
Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
Fen Zhou, Miklós Molnár, Bernard Cou...
ACCV
2010
Springer
14 years 6 months ago
Earth Mover's Morphing: Topology-Free Shape Morphing Using Cluster-Based EMD Flows
Abstract. This paper describes a method for topology-free shape morphing based on region cluster-based Earth Mover's Distance (EMD) flows, since existing methods for closed cu...
Yasushi Makihara, Yasushi Yagi
TCS
2011
14 years 6 months ago
Highly concurrent multi-word synchronization
d Abstract) Hagit Attiya and Eshcar Hillel Department of Computer Science, Technion The design of concurrent data structures is greatly facilitated by the availability of synchroni...
Hagit Attiya, Eshcar Hillel