Výsledky vyhledávání - "I/O-efficient algorithms"

Efficient structural graph clustering: an index-based approach Autor Wen, Dong, Qin, Lu, Zhang, Ying, Chang, Lijun, Lin, Xuemin

“…Graph clustering is a fundamental problem widely applied in many applications. The structural graph clustering ( SCAN ) method obtains not only clusters but…”
Získat plný text

I/O-efficient algorithms for top-k nearest keyword search in massive graphs Autor Zhu, Qiankun, Cheng, Hong, Huang, Xin

“…Networks emerging nowadays usually have labels or textual content on the nodes. We model such commonly seen network as an undirected graph G , in which each…”
Získat plný text

I/O-Efficient Planar Separators Autor Maheshwari, Anil, Zeh, Norbert

“…We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph $G$ with $N$…”
Získat plný text

Processing Huge Graphs with Stxxl Autor Dementiev, Roman

Získat plný text

External memory pipelining made easy with TPIE Autor Arge, Lars, Rav, Mathias, Svendsen, Svend C., Truelsen, Jakob

“…When handling large datasets that exceed the capacity of the main memory, movement of data between main memory and external memory (disk), rather than actual…”
Získat plný text

Cluster-Based I/O-Efficient LTL Model Checking Autor Barnat, J., Brim, L., Simecek, P.

“…I/O-efficient algorithms take the advantage of large capacities of external memories to verify huge state spaces even on a single machine with low-capacity…”
Získat plný text

Survey: Computational Models for Asymmetric Read and Write Costs Autor Gu, Yan

“…With the arrival of new emerging technologies for non-volatile main memory, the cost of reading from memory will be significantly cheaper than the cost of…”
Získat plný text

Finding influential communities in massive networks Autor Li, Rong-Hua, Qin, Lu, Yu, Jeffrey Xu, Mao, Rui

“…Community search is a problem of finding densely connected subgraphs that satisfy the query conditions in a network, which has attracted much attention in…”
Získat plný text

I/O efficient structural clustering and maintenance of clusters for large-scale graphs Autor Seo, Jung Hyuk, Kim, Myoung Ho

“…In recent years, the size of graph data has increased significantly, but most existing graph clustering algorithms do not consider the case where the size of…”
Získat plný text

EI-LSH: An early-termination driven I/O efficient incremental c-approximate nearest neighbor search Autor Liu, Wanqi, Wang, Hanchen, Zhang, Ying, Wang, Wei, Qin, Lu, Lin, Xuemin

“…Nearest neighbor in high-dimensional space has been widely used in various fields such as databases, data mining and machine learning. The problem has been…”
Získat plný text

I/O-Efficient Algorithms for Degeneracy Computation on Massive Networks Autor Li, Rong-Hua, Song, Qiushuo, Xiao, Xiaokui, Qin, Lu, Wang, Guoren, Yu, Jeffrey Xu, Mao, Rui

“…Degeneracy is an important concept to measure the sparsity of a graph which has been widely used in many network analysis applications. Many network analysis…”
Získat plný text

I/O efficient ECC graph decomposition via graph reduction Autor Yuan, Long, Qin, Lu, Lin, Xuemin, Chang, Lijun, Zhang, Wenjie

“…The problem of computing k -edge connected components ( k - ECC s) of a graph G for a specific k is a fundamental graph problem and has been investigated…”
Získat plný text

I/O Efficient Early Bursting Cohesive Subgraph Discovery in Massive Temporal Networks Autor Li, Yuan, Dai, Jie, Fan, Xiao-Lin, Zhao, Yu-Hai, Wang, Guo-Ren

“…Temporal networks are an effective way to encode temporal information into graph data losslessly. Finding the bursting cohesive subgraph (BCS), which…”
Získat plný text

iTri: Index-based triangle listing in massive graphs Autor Rasel, Mostofa Kamal, Han, Yongkoo, Kim, Jinseung, Park, Kisung, Tu, Nguyen Anh, Lee, Young-Koo

“…Triangle listing is a basic operator when dealing with many graph problems. However, in-memory algorithms do not work well with recently developed massive…”
Získat plný text

PDTL: Parallel and Distributed Triangle Listing for Massive Graphs Autor Giechaskiel, Ilias, Panagopoulos, George, Yoneki, Eiko

“…This paper presents the first distributed triangle listing algorithm with provable CPU, I/O, Memory, and Network bounds. Finding all triangles (3-cliques) in a…”
Získat plný text