Greedy embedding

In distributed computing and geometric graph theory, greedy embedding is a process of assigning coordinates to the nodes of a telecommunications…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

For a positive integer k, a book (with k pages) is a topological space consisting of a spine, which is a line, and k pages, which…

2014

Wireless network virtualization enables multiple virtual wireless networks to coexist on shared physical infrastructure. However…

2013

The k-LSBs multi-bit minimum error replacement (MER) is a method used for embedding multi-bit logo/secret data into k least…

2013

To achieve anonymous and censorship-resistant overlay communication, darknets restrict overlay links to trusted parties…

2013

Using greedy routing, network nodes forward packets towards neighbors which are closer to their destination. This approach makes…

2012

Resource discovery aims to assist the Virtual Network Provider (VNP) in selecting the best Infrastructure Provider (InP) which…

2012

Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source…

2009

Recent advances in systems of networked sensors have set the stage for smart environments which will have wide-ranging…

2006

A greedy embedding of an unweighted undirected graph G = (V, E) into a metric space (X, ρ) is a function f : V → X such that for…

2004

We propose a quantitative steganalysis method to detect hidden information embedded by flipping pixels along boundaries in binary…