A survey on NoSQL stores
Recent demands for storing and querying big data have revealed various shortcomings of
traditional relational database systems. This, in turn, has led to the emergence of a new kind …
traditional relational database systems. This, in turn, has led to the emergence of a new kind …
A survey of computation offloading for mobile systems
Mobile systems have limited resources, such as battery life, network bandwidth, storage
capacity, and processor performance. These restrictions may be alleviated by computation …
capacity, and processor performance. These restrictions may be alleviated by computation …
[PDF][PDF] Bootstrap** entity alignment with knowledge graph embedding.
Embedding-based entity alignment represents different knowledge graphs (KGs) as low-
dimensional embeddings and finds entity alignment by measuring the similarities between …
dimensional embeddings and finds entity alignment by measuring the similarities between …
A benchmarking study of embedding-based entity alignment for knowledge graphs
Entity alignment seeks to find entities in different knowledge graphs (KGs) that refer to the
same real-world object. Recent advancement in KG embedding impels the advent of …
same real-world object. Recent advancement in KG embedding impels the advent of …
Device placement optimization with reinforcement learning
The past few years have witnessed a growth in size and computational requirements for
training and inference with neural networks. Currently, a common approach to address …
training and inference with neural networks. Currently, a common approach to address …
[LIVRE][B] Data classification
CC Aggarwal, CC Aggarwal - 2015 - Springer
The classification problem is closely related to the clustering problem discussed in Chaps. 6
and 7. While the clustering problem is that of determining similar groups of data points, the …
and 7. While the clustering problem is that of determining similar groups of data points, the …
[LIVRE][B] Recent advances in graph partitioning
Recent Advances in Graph Partitioning | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
A fast and high quality multilevel scheme for partitioning irregular graphs
Recently, a number of researchers have investigated a class of graph partitioning algorithms
that reduce the size of the graph by collapsing vertices and edges, partition the smaller …
that reduce the size of the graph by collapsing vertices and edges, partition the smaller …
Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
A large body of work has been devoted to defining and identifying clusters or communities in
social and information networks, ie, in graphs in which the nodes represent underlying …
social and information networks, ie, in graphs in which the nodes represent underlying …
A survey of direct methods for sparse linear systems
Wilkinson defined a sparse matrix as one with enough zeros that it pays to take advantage of
them. 1 This informal yet practical definition captures the essence of the goal of direct …
them. 1 This informal yet practical definition captures the essence of the goal of direct …