Filters








28,154 Hits in 6.1 sec

On Efficient External-Memory Triangle Listing

Yi Cui, Di Xiao, Dmitri Loguinov
2016 2016 IEEE 16th International Conference on Data Mining (ICDM)  
To shed light on this problem, we first generalize the existing in-memory algorithms into a single framework of 18 triangle-search techniques.  ...  Discovering triangles in large graphs is a wellstudied area; however, both external-memory performance of existing methods and our understanding of the complexity involved leave much room for improvement  ...  However, external-memory triangle listing remains largely unexplored.  ... 
doi:10.1109/icdm.2016.0021 dblp:conf/icdm/CuiXL16 fatcat:dlofzgdk3ra7tabfnfnvwqbx7y

On Efficient External-Memory Triangle Listing

Yi Cui, Di Xiao, Dmitri Loguinov
2018 IEEE Transactions on Knowledge and Data Engineering  
To shed light on this problem, we first generalize the existing in-memory algorithms into a single framework of 18 triangle-search techniques.  ...  Discovering triangles in large graphs is a wellstudied area; however, both external-memory performance of existing methods and our understanding of the complexity involved leave much room for improvement  ...  However, external-memory triangle listing remains largely unexplored.  ... 
doi:10.1109/tkde.2018.2858820 fatcat:qjkgqbfp7rcjzgtvvq2oa7xoue

OPT

Jinha Kim, Wook-Shin Han, Sangyeon Lee, Kyungyeol Park, Hwanjo Yu
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
In OPT, triangles in memory are called the internal triangles while triangles constituting vertices in memory and vertices in external memory are called the external triangles.  ...  Extensive experiments conducted on large-scale datasets showed that (1) OPT achieved the elapsed time close to that of the ideal method with less than 7% of overhead under the limited memory budget, (2  ...  Thus, to find all triangles, the adjacency lists (e.g. n(f )), which are required to find the external triangles (e.g. cf g ), should be loaded in main memory.  ... 
doi:10.1145/2588555.2588563 dblp:conf/sigmod/KimHLPY14 fatcat:h6yopziwa5b43f7tw5c4pt25sq

External Memory View-Dependent Simplification

Jihad El-Sana, Yi-Jen Chiang
2000 Computer graphics forum (Print)  
This is based on a novel, I/O-efficient spanned sub-meshes simplification technique.  ...  In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory.  ...  External Memory Techniques We now briefly review the work on external-memory techniques.  ... 
doi:10.1111/1467-8659.00406 fatcat:n4lusiwmsbh47fochk5dqjazja

Scaling Techniques for Massive Scale-Free Graphs in Distributed (External) Memory

Roger Pearce, Maya Gokhale, Nancy M. Amato
2013 2013 IEEE 27th International Symposium on Parallel and Distributed Processing  
We present techniques to process large scale-free graphs in distributed memory.  ...  We present a scaling study with three important graph algorithms: Breadth-First Search (BFS), K-Core decomposition, and Triangle Counting.  ...  ., BFS) are efficient when computing sequentially in-memory, but become impractical in external memory.  ... 
doi:10.1109/ipdps.2013.72 dblp:conf/ipps/PearceGA13 fatcat:e6l6dyhzj5bo5nceq7iglhvi3i

PDTL: Parallel and Distributed Triangle Listing for Massive Graphs

Ilias Giechaskiel, George Panagopoulos, Eiko Yoneki
2015 2015 44th International Conference on Parallel Processing  
Our Parallel and Distributed Triangle Listing (PDTL) framework focuses on efficient external-memory access in distributed environments instead of fitting subgraphs into memory.  ...  This paper presents the first distributed triangle listing algorithm with provable CPU, I/O, Memory, and Network bounds.  ...  As a result, triangle listing and counting has a wide range of applications, but research has been limited on either external memory considerations, or the creation of parallel frameworks (Section II).  ... 
doi:10.1109/icpp.2015.46 dblp:conf/icpp/GiechaskielPY15 fatcat:pmfjds3xdjetxihroelphet6si

Out-of-core construction and visualization of multiresolution surfaces

Peter Lindstrom
2003 Proceedings of the 2003 symposium on Interactive 3D graphics - SI3D '03  
Meanwhile, all phases of the method are both disk and memory efficient, and are fairly straightforward to implement.  ...  Similar to recent work on out-of-core simplification, our memory insensitive method uses vertex clustering on a uniform octree grid to coarsen a mesh and create a hierarchy, and a quadric error metric  ...  Table 2 lists pseudo-code for the octree construction. We begin by externally sorting the triangle file on its reversed octcode field v * .  ... 
doi:10.1145/641498.641500 fatcat:442c5abpxbachdmfoqs2sddtp4

Bermuda

Dongqing Xiao, Mohamed Eltabakh, Xiangnan Kong
2016 Proceedings of the 28th International Conference on Scientific and Statistical Database Management - SSDBM '16  
Inspired by this observation, we present the "Bermuda" method, an efficient MapReducebased triangle listing technique for massive graphs.  ...  Extensive experiments conducted on real-world large-scale graphs show that Bermuda speeds up the triangle listing computations by factors up to 10x.  ...  External-memory algorithms exploit asynchronous I/O and multi-core parallelism for efficient triangle listing [13, 14, 19] .  ... 
doi:10.1145/2949689.2949715 dblp:conf/ssdbm/XiaoEK16 fatcat:agxm62xquffv3jsjcytemdfeda

Out-of-core construction and visualization of multiresolution surfaces

Peter Lindstrom
2003 Proceedings of the 2003 symposium on Interactive 3D graphics - SI3D '03  
Meanwhile, all phases of the method are disk and memory efficient, and are fairly straightforward to implement.  ...  Similar to recent work on out-of-core simplification, our memory insensitive method uses vertex clustering on a rectilinear octree grid to coarsen and create a hierarchy for the mesh, and a quadric error  ...  Table 2 lists pseudo-code for the octree construction. We begin by externally sorting the triangle file on its reversed octcode field v * .  ... 
doi:10.1145/641480.641500 dblp:conf/si3d/Lindstrom03 fatcat:z6nnow6iljbczdhmokkb5znf5i

External memory management and simplification of huge meshes

P. Cignoni, C. Montani, C. Rocchini, R. Scopigno
2003 IEEE Transactions on Visualization and Computer Graphics  
The time overhead due to the external memory management is affordable. Results of the test of our system on complex meshes are presented.  ...  In this paper we present a data structure called Octreebased External Memory Mesh (OEMM ).  ...  We would like to thank Marc Levoy and the Stanford Computer Graphics Group for providing scanned data, and for choosing our simplified meshes as the official simplified models distributed on the project's  ... 
doi:10.1109/tvcg.2003.1260746 fatcat:kbifc6cshba6pdu3rn2x25w6cu

Fast In-Memory Triangle Listing for Large Real-World Graphs

Martin Sevenich, Sungpack Hong, Adam Welc, Hassan Chafi
2014 Proceedings of the 8th Workshop on Social Network Mining and Analysis - SNAKDD'14  
In this paper we propose a fast and precise in-memory solution for the triangle listing problem.  ...  Triangle listing, or identifying all the triangles in an undirected graph, is a very important graph problem that serves as a building block of many other graph algorithms.  ...  Note that solving the triangle listing problem trivially solves the triangle counting problem, as one can simply enumerate all the triangles without producing the list.  ... 
doi:10.1145/2659480.2659494 dblp:conf/kdd/SevenichHWC14 fatcat:2pxymlguorb73bvvypyfcrzw6e

COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS

DANIEL K. BLANDFORD, GUY E. BLELLOCH, DAVID E. CARDOZE, CLEMENS KADOW
2005 International journal of computational geometry and applications  
, storing data on simplices, and insertion and deletion of simplices.  ...  Our data structure requires about a factor of five less memory than the most efficient standard data structures for triangular or tetrahedral meshes, while efficiently supporting traversal among simplices  ...  Acknowledgements We are grateful to Jonathan Shewchuk for commenting on the paper and letting us use a pre-release version of Pyramid.  ... 
doi:10.1142/s0218195905001580 fatcat:bgjn4ryi5vhbhkbkxpsvq525xq

Efficient Representation of Triangle Meshes for Simultaneous Modification and Rendering [chapter]

Horst Birthelmer, Ingo Soetebier, Jörg Sahm
2003 Lecture Notes in Computer Science  
This paper introduces an efficient representation of triangulated meshes for the simultaneous modification and rendering in realtime.  ...  The modification includes the simplification and the refinement of the triangle meshes as well as the animation of their vertices.  ...  It offers the posibility to access geometry and topology information stored on external memory like harddisks.  ... 
doi:10.1007/3-540-44860-8_96 fatcat:z34v3l7zobe7bjgxby2hcqhlcu

Realtime Ray Tracing of Dynamic Scenes on an FPGA Chip [article]

Jörg Schmittler, Sven Woop, Daniel Wagner, Wolfgang J. Paul, Philipp Slusallek
2004 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware - HWWS '04  
A particular interesting feature of the design is the re-use of the transformation unit necessary for supporting dynamic scenes also for other tasks, including efficient ray-triangle intersection as well  ...  In this paper we present a prototype implementation of the full ray tracing pipeline on a single FPGA chip.  ...  Table 4 : 4 Table4provides a more detailed view on the external memory bandwidth and the cache hit rates. These measurements were taken at a screen resolution of 1024 × 768.  ... 
doi:10.2312/eggh/eggh04/095-106 fatcat:taar27rdmvhmddon72g7ju5ksy

Triangle listing in massive networks and its applications

Shumo Chu, James Cheng
2011 Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '11  
We propose an I/O-efficient algorithm for triangle listing. Our algorithm is exact and avoids random disk access.  ...  When the input graph cannot fit into main memory, triangle listing requires random disk accesses that can incur prohibitively large I/O cost.  ...  Algorithm 1 In-Memory Triangle Listing Input: A graph G = (VG, EG) Output: △(G) Acknowledgment The authors would like to thank the reviewers for their constructive comments.  ... 
doi:10.1145/2020408.2020513 dblp:conf/kdd/ChuC11 fatcat:jmidmuy465av5auzdes6pc2jri
« Previous Showing results 1 — 15 out of 28,154 results