Detouring Skip Graph: Efficient Routing via Detour Routes on Skip Graph Topology

Tiara: A self-stabilizing deterministic skip list and skip graph

We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.

Skip-graph: Learning Graph Embeddings with an Encoder-decoder Model

In this work, we study the problem of feature representation learning for graphstructured data. Many of the existing work in the area are task-specific and based on supervised techniques. We study a method for obtaining a generic feature representation for a graph using an unsupervised approach. The neural encoderdecoder model is a method that has been used in the natural language processing do...

Nearest Neighbor Search on Large-scale Data Using Skip Graph

Nearest neighbor search is one of the most fundamental queries on massive datasets, and it has extensive applications such as pattern recognition, statistical classification, graph algorithms, Location-Based Services and online recommendations. In this report, we propose a new searchable scheme, which can efficiently and securely enable nearest neighbor search over encrypted data on untrusted n...

Randomized Skip Graph-Based Authentication for Large-Scale RFID Systems

Breakfast: To Skip or Not to Skip?

Human eating behaviors are often nonhomeostatic, and thus unlike homeostatic behaviors, they are not exclusively reliant on rigid brain mechanisms, but heavily depend on psychological, sociocultural, and educational factors as well. A clear understanding of the mechanisms and consequences of various eating behaviors is necessary for giving comprehensive educational guidance. However, recommenda...