Skip to search formSkip to main contentSkip to account menu

Greedy embedding

In distributed computing and geometric graph theory, greedy embedding is a process of assigning coordinates to the nodes of a telecommunications… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Hypergraph is a data structure commonly used to represent connections and relations between multiple objects. Embedding a… 
2017
2017
Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source… 
Highly Cited
2009
Highly Cited
2009
Recently network virtualization has been proposed as a promising way to overcome the current ossification of the Internet by… 
2009
2009
We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable… 
Highly Cited
2009
Highly Cited
2009
Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination… 
Highly Cited
2008
Highly Cited
2008
In this paper, we propose a framework that fuses multiple features for improved action recognition in videos. The fusion of… 
Highly Cited
2008
Highly Cited
2008
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of… 
Highly Cited
2007
Highly Cited
2007
We present a new approach for generating virtual coordinates that produces usable coordinates quickly and improves the routing… 
Highly Cited
2006
Highly Cited
2006
Metric Embedding plays an important role in a vast range of application areas such as computer vision, computational biology… 
1994
1994
Searching via error code graph (ECG) to find the optimal morphological erosion filter is proposed. The problem to find the…