138 Hits in 8.8 sec

TRIÈST: Counting Local and Global Triangles in Fully-dynamic Streams with Fixed Memory Size [article]

Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal
2016 arXiv   pre-print
in a fully-dynamic graph represented as an adversarial stream of edge insertions and deletions.  ...  We present TRI\'EST, a suite of one-pass streaming algorithms to compute unbiased, low-variance, high-quality approximations of the global and local (i.e., incident to each vertex) number of triangles  ...  ACKNOWLEDGMENTS This work was supported in part by NSF grant IIS-1247581 and NIH grant R01-CA180776.  ... 
arXiv:1602.07424v2 fatcat:xgetcslwzndi5jjp42rfncgw6y


Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal
2016 Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '16  
We present trièst, a suite of one-pass streaming algorithms to compute unbiased, low-variance, high-quality approximations of the global and local (i.e., incident to each vertex) number of triangles in  ...  a fully-dynamic graph represented as an adversarial stream of edge insertions and deletions.  ...  SampleEdge (u, v) then Fully-dynamic algorithmtrièst-fd trièst-fd computes unbiased estimates of the global and local triangle counts in a fully-dynamic stream where edges are inserted/deleted in any  ... 
doi:10.1145/2939672.2939771 dblp:conf/kdd/StefaniERU16 fatcat:zcsj6ncbw5gaxkt7xe5yohtnp4

On Counting Triangles through Edge Sampling in Large Dynamic Graphs [article]

Guyue Han, Harish Sethu
2018 arXiv   pre-print
It generates an unbiased estimate of the total number of triangles, which can be continuously updated in response to both edge additions and deletions.  ...  Traditional frameworks for dynamic graphs have relied on processing only the stream of edges added into or deleted from an evolving graph, but not any additional related information such as the degrees  ...  Eigenvalue-based methods are one class of algorithms used to approximate the global and local number of triangles in the graph [3, 29] .  ... 
arXiv:1706.04660v2 fatcat:7gq7ah2csje2naobrhed2pevmy

CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams [article]

Kijung Shin, Euiwoong Lee, Jinoh Oh, Mohammad Hammoud, Christos Faloutsos
2021 arXiv   pre-print
In this work, we propose CoCoS, a fast and accurate distributed streaming algorithm for estimating the counts of global triangles (i.e., all triangles) and local triangles incident to each node.  ...  For triangle counting in large and dynamic graphs, recent work has focused largely on streaming algorithms and distributed algorithms but little on their combinations for "the best of both worlds".  ...  [9] explored the local triangle counting in a fully dynamic graph stream with both edge insertions and deletions.  ... 
arXiv:1802.04249v5 fatcat:w7u3c3t7ezax3hlgclsptmj42u

Fast and Scalable Triangle Counting in Graph Streams: The Hybrid Approach

Paramvir Singh, Venkatesh Srinivasan, Alex Thomo
2021 International Conference on Advanced Information Networking and Applications  
Triangle counting is a major graph problem with several applications in social network analysis, anomaly detection, etc.  ...  We present two new algorithms that belong to the hybrid category: Neighbourhood Hybrid Multisampling (NHMS) and Triest/ThinkD Hybrid Sampling (THS) for estimating the number of global triangles in graphs  ...  Jasbir Singh for being a good friend, providing support throughout, and sharing his knowledge. x DEDICATION This work is dedicated to my parents and my loving sister! Thanks for believing in me.  ... 
doi:10.1007/978-3-030-75075-6_9 dblp:conf/aina/SinghST21 fatcat:27ijhdqoarbovlsc2ebdruntgq

Approximately counting triangles in large graph streams including edge duplicates with a fixed memory usage

Pinghui Wang, Yiyan Qi, Yu Sun, Xiangliang Zhang, Jing Tao, Xiaohong Guan
2017 Proceedings of the VLDB Endowment  
However, it is challenging to compute the number of triangles in a large graph represented as a stream of edges with a low computational cost when given a limited memory.  ...  Counting triangles in a large graph is important for detecting network anomalies such as spam web pages and suspicious accounts (e.g., fraudsters and advertisers) on online social networks.  ...  Acknowledgment The research presented in this paper is supported in part by Na-  ... 
doi:10.14778/3149193.3149197 fatcat:wwabcg2tenfjdhzc3eo3j35scu

FURL: Fixed-memory and Uncertainty Reducing Local Triangle Counting for Graph Streams [article]

Minsoo Jung, Sunmin Lee, Yongsub Lim, U Kang
2016 arXiv   pre-print
Also, FURL handles a stream of any size by using a fixed amount of memory.  ...  Local triangle counting in a graph stream is one of the most fundamental tasks in graph mining with important applications including anomaly detection and social network analysis.  ...  [29] proposed TRIEST which computes the number of triangles in fully-dynamic streams with a fixed memory size.  ... 
arXiv:1611.06615v2 fatcat:xgetig6pf5f3bbfsw4astcihjm

Adaptive Shrinkage Estimation for Streaming Graphs [article]

Nesreen K. Ahmed, Nick Duffield
2020 arXiv   pre-print
Our approach is fully analytic, computationally efficient, and can be incrementally updated in a streaming setting.  ...  However, in many practical applications such as online social networks, networks are massive, dynamic, and naturally streaming, where pairwise interactions among vertices become available one at a time  ...  In the streaming setting, most work focused on estimating point statistics using fixed probabilities, e.g., the global triangle or motif count using reservoir based sampling approaches; see [53] .  ... 
arXiv:1908.01087v4 fatcat:nvtj6266mvfsxmpkzj7jlza4iq

Quantification of dissolved CO2 plumes at the Goldeneye CO2-release experiment

Jonas Gros, Mark Schmidt, Peter Linke, Saskia Dötsch, Jack Triest, María Martínez-Cabanas, Mario Esposito, Andrew W. Dale, Stefan Sommer, Anita Flohr, Joseph Fone, Jonathan M. Bull (+6 others)
2021 International Journal of Greenhouse Gas Control  
The new leakage monitoring tool predicts that 91 kg d -1 of CO 2 escaped across the seafloor, and that 51 kg d -1 of CO 2 were retained in the sediment, in agreement with independent field estimates.  ...  Here, we combine field measurements with numerical models to determine the flow rate of a controlled release of CO 2 in a shallow marine setting at about 119 m water depth in the North Sea.  ...  Acknowledgments We thank the captains and crews for support provided during the RV Poseidon and RRS James Cook cruises, the ROV Isis team, Sergiy Cherednichenko and Andrea Bodenbinder for technical support  ... 
doi:10.1016/j.ijggc.2021.103387 fatcat:avkxhl5iivfajkj3iaemjesute

Technical Design Report for the: PANDA Micro Vertex Detector [article]

PANDA Collaboration: W. Erni, B. Krusche, Q. Wang, F. Feldbauer , H. Koch, J. Pychy, T. Trifterer, S. Bianco, R. Jäkel, R. Schnell , Th. Würschig , M. Caprini, M. De Napoli, N. Idzik, E. Bialkowski (+167 others)
2012 arXiv   pre-print
Design criteria and the optimisation process as well as the technical solutions chosen are discussed and the results of this process are subjected to extensive Monte Carlo physics studies.  ...  This document illustrates the technical layout and the expected performance of the Micro Vertex Detector (MVD) of the PANDA experiment.  ...  The FE-I3 has been tested with the digital readout board A, the ToPix v2 with both the readout boards A and B.  ... 
arXiv:1207.6581v2 fatcat:qjbrupqhrna5phsezkqxyeuhhy

Triangle Counting by Adaptively Resampling over Evolving Graph Streams

Wei Xuan
2021 Proceedings of the 33rd International Conference on Software Engineering and Knowledge Engineering   unpublished
Then, we design BSR-TC, a single-pass streaming algorithm for both global and local triangle counting, based on BSR-Sample.  ...  Due to the large scale of graph streams and limited memory space, it is appropriate to achieve the estimation of global and local triangles by sampling.  ...  On the other hand, the fully dynamic characteristics of evolving graph streams also induces the difficulties of accurately counting global and local triangles within limited memory space.  ... 
doi:10.18293/seke2021-012 fatcat:53imw4pjhrhynoz3rc56j45m3a

D8.1.4: Plan for Community Code Refactoring

Claudio Gheller, Will Sawyer
2012 Zenodo  
Each code is supplied with a standard test suite, which allows the verification of quality and correctness of the re-implemented software.  ...  For each code selected in the domains of Astrophysics, Material Science, Climate and Particle Physics, we provide a short summary of the algorithms to be the subject of refactoring.  ...  It is written in Fortran90, C and python and relies on MPI for parallel simulations.  ... 
doi:10.5281/zenodo.6572340 fatcat:mobdwam6kzgzvf2th46k7b66k4

39th European Conference on Visual Perception (ECVP) 2016 Barcelona

2016 Perception  
Replacement to the fully fully-corrected lenses introduced binocular size differences of the retinal image.  ...  Previously, we used dot localization to measure precision and accuracy of perceived boundaries for partially occluded objects with divergent local and global symmetry completions.  ...  On target-present trials, proportions of immediate target fixations were well above chance and changed only minimally with set size.  ... 
doi:10.1177/0301006616671273 fatcat:el2dmsuk6zd25pedijucuexl5m

166 Attentional capture and oculomotor control

Arthur F. Kramer, Sowon Hahn, David E. Irwin, Jan Theeuwes
1998 International Journal of Psychophysiology  
A model is suggested which is based on local and global dynamic interactions in which: (i) a local polarity distortion occurs at each single-square element and in the field around each of its elements,  ...  ^Competitive global and local dynamics in the formation of contours from perceptual grouping S Manca, B Pinna (Department Human Sciences and Antiquities, University of Sassari, piazza Conte di Moriana  ... 
doi:10.1016/s0167-8760(98)90166-0 fatcat:7o5vmrk5zvbizd23bmpcbkrs7q

Extraction of spatio-temporal primitives of emotional body expressions

Lars Omlor, Martin A. Giese
2007 Neurocomputing  
(a grid with equilateral triangles as units).  ...  Do the number of fix points scale exponentially with the size of the network, or can it scale polynomially with it ?  ... 
doi:10.1016/j.neucom.2006.10.100 fatcat:esivhljzsbcihdl5qbp756josu
« Previous Showing results 1 — 15 out of 138 results