Topic
Adjacency list
About: Adjacency list is a research topic. Over the lifetime, 4419 publications have been published within this topic receiving 78449 citations.
Papers published on a yearly basis
Papers
More filters
01 Nov 1985-Graphical Models \/graphical Models and Image Processing \/computer Vision, Graphics, and Image Processing
TL;DR: It is shown how a wide class of digital pictures have natural "continuous analogs" and is able to prove general results on the connectivity of digital borders, which generalize results that have appeared in the literature.
Abstract: We study 2- and 3-dimensional digital geometry in the context of almost arbitrary adjacency relations. (Previous authors have based their work on particular adjacency relations.) We define a binary digital picture to be a pair whose components are a set of lattice-points and an adjacency relation on the whole lattice. We show how a wide class of digital pictures have natural "continuous analogs." This enables us to use methods of continuous topology in studying digital pictures. We are able to prove general results on the connectivity of digital borders, which generalize results that have appeared in the literature. In the 3-dimensional case we consider the possibility of using a uniform relation on the whole lattice. (In the past authors have used different types of adjacency for "object" and "background.") �9 1985 Academic Press, Inc. PREREQUISITES
71 citations
TL;DR: In this paper, an automatic faulted line section location method for distribution systems is presented, which can be divided into two parts: faulted area identification technique for low-voltage distribution systems and a relational table that shows the association relationship between smart meters, meter boxes and distribution transformers.
Abstract: This paper presents an automatic faulted line section location method for distribution systems. It can be divided into two parts: faulted line section location method for medium-voltage distribution feeders and faulted area identification technique for low-voltage distribution systems. In the first part, an adjacency list that shows the adjacency relationship and status of fault indicating devices is developed. Then, an iterative search technique is devised to traverse the adjacency list to determine the faulted line section. In the second part, a relational table that shows the association relationship between smart meters, meter boxes, and distribution transformers is developed. Based on the table and the voltage of smart meters received from the customer electric information acquisition system, the faulted area can be located. Several test cases studied in a real distribution system demonstrate the effectiveness of the proposed method.
70 citations
26 Oct 2010
TL;DR: Experiments show that this class of encoders outperform all the existing methods in literature by more than 10% (with the exception of Binary Interpolative Coding with which they, roughly, tie) still retaining a very fast decompression algorithm.
Abstract: Encoding lists of integers efficiently is important for many applications in different fields. Adjacency lists of large graphs are usually encoded to save space and to improve decoding speed. Inverted indexes of Information Retrieval systems keep the lists of postings compressed in order to exploit the memory hierarchy. Secondary indexes of DBMSs are stored similarly to inverted indexes in IR systems. In this paper we propose Vector of Splits Encoding (VSEncoding), a novel class of encoders that work by optimally partitioning a list of integers into blocks which are efficiently compressed by using simple encoders. In previous works heuristics were applied during the partitioning step. Instead, we find the optimal solution by using a dynamic programming approach. Experiments show that our class of encoders outperform all the existing methods in literature by more than 10% (with the exception of Binary Interpolative Coding with which they, roughly, tie) still retaining a very fast decompression algorithm.
70 citations
01 Sep 2016
TL;DR: This paper presents GraphJet, an in-memory graph processing engine that maintains a real-time bipartite interaction graph between users and tweets and organizes the interaction graph into temporally-partitioned index segments that hold adjacency lists.
Abstract: This paper presents GraphJet, a new graph-based system for generating content recommendations at Twitter. As motivation, we trace the evolution of our formulation and approach to the graph recommendation problem, embodied in successive generations of systems. Two trends can be identified: supplementing batch with real-time processing and a broadening of the scope of recommendations from users to content. Both of these trends come together in Graph-Jet, an in-memory graph processing engine that maintains a real-time bipartite interaction graph between users and tweets. The storage engine implements a simple API, but one that is sufficiently expressive to support a range of recommendation algorithms based on random walks that we have refined over the years. Similar to Cassovary, a previous graph recommendation engine developed at Twitter, GraphJet assumes that the entire graph can be held in memory on a single server. The system organizes the interaction graph into temporally-partitioned index segments that hold adjacency lists. GraphJet is able to support rapid ingestion of edges while concurrently serving lookup queries through a combination of compact edge encoding and a dynamic memory allocation scheme that exploits power-law characteristics of the graph. Each GraphJet server ingests up to one million graph edges per second, and in steady state, computes up to 500 recommendations per second, which translates into several million edge read operations per second.
70 citations
TL;DR: This algorithm is derived from a generalized framework for describing functionally expanded interpolators which is based on the theory of reproducing kernel Hilbert spaces (RKHS) and incorporates a general approach to a wide class of graph matching problems based on attributed graphs.
Abstract: We present an algorithm for performing attributed graph matching. This algorithm is derived from a generalized framework for describing functionally expanded interpolators which is based on the theory of reproducing kernel Hilbert spaces (RKHS). The algorithm incorporates a general approach to a wide class of graph matching problems based on attributed graphs, allowing the structure of the graphs to be based on multiple sets of attributes. No assumption is made about the adjacency structure of the graphs to be matched.
70 citations