A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We define a quality assessment model of a summary with regards to a gold standard summary. We evaluate over several datasets the trade-offs between efficiency and precision of the algorithms. ... With regards to an application, experiments highlight the need to trade-off the precision and volume of a graph summary with the complexity of a summarisation technique. ... Acknowledgement This material is based upon works supported by the European FP7 project LOD2 (257943) and the Irish Research Council for Science, Engineering and Technology. ...doi:10.1145/2513591.2513654 dblp:conf/ideas/CampinasDT13 fatcat:2ssbs6wjbffepbbgbkojx5u3im
We also define the concept of /-precision unit disk graphs and show that for such graphs the approximation schemes have a better time versus performance trade-off than the approximation schemes for arbitrary ... Moreover, compared to unit disk graphs, we show that for /-precision unit disk graphs many more graph problems have efficient approximation schemes. ...
Moreover, an efficient framework to cluster previous summaries with new data is explored. ... Although learning summaries from original data costs more than those from previous clusters, the entire framework consumes just a little bit more time because clustering current data and generating summaries ... Acknowledgment This work was supported by the National Natural Science Foundation of China (Nos. 61701277 and 61771288) and the State Key Development Program in 13th Five-Year (Nos. 2016YFB0801301, 044007008 ...doi:10.26599/tst.2020.9010024 fatcat:24bopbcw4rfn7nm5hvldwm5bti
(NL-UTRE-C; Utrecht); Tel, Gerard (NL-UTRE-C; Utrecht); Santoro, Nicola (3-CARL-SC; Ottawa, ON) Trade-offs in non-reversing diameter. (English summary) Nordic J. Comput. 1 (1994), no. 1, 111-134. ... Summary: “The Hopcroft-Tarjan and Lempel-Even-Cederbaum algorithms have generally been viewed as different approaches to planarity testing and graph embedding. ...
the best trade-off between precision and efficiency. ... to achieve a better trade-off between precision and efficiency. ...doi:10.1145/1108768.1108797 fatcat:37m57x4dtbf57mb5eurhlsp5va
The obtained results show interesting trade-offs between the algorithms runtime speed-up and the precision loss. ... Moreover, we conducted several experiments on the obtained summaries using various graph algorithms and applications, such as node embedding, graph classification and shortest path approximations. ... The results show interesting trade-offs between algorithm runtime speed-up and precision loss. ...arXiv:2101.11559v1 fatcat:t26vio4dmreohaa5ohqwxsjhju
We also studied the trade-off between ranking effectiveness and space requirements. ... The off-line phase of our approach computes a "score map" for each node in the web graph by performing a SALSA-like algorithm on the neighborhood of that node and retaining the scores of the most promising ... CONCLUSION This paper describes a novel approach to link-based ranking that represents an interesting trade-off between effectiveness and efficiency. ...doi:10.1145/1458082.1458093 dblp:conf/cikm/NajorkC08 fatcat:uyf6noxqi5htll67pouy7tydkq
Moreover, trade-offs 68 COMPUTER SCIENCE 2908 are derived between the number of intervals k and the number of buffers s in (k, s)-DFILS for hypercubes, grids, tori, and Cartesian products of graphs.” 2000d ... We further extend the result by showing a connection between the efficiency of linear interval routing and the total>- diameter (defined in Section 4) of the network, and by presenting a family of graphs ...
the best trade-off between precision and efficiency. ... to achieve a better trade-off between precision and efficiency. ...doi:10.1145/1108792.1108797 dblp:conf/paste/LiangPH05 fatcat:33wnagy5rvcrdixwt3yilhgu5e
Lecture Notes in Computer Science
We have improved the precision of their algorithm by tracking the fields of individual objects separately and by analyzing the local variables in a method in a flowsensitive manner. ... By utilizing the access path and field information present in the summary graphs, along with minimizing redundant operations and memory management overheads, we are able to quickly and effectively analyze ... One of the major concerns in the design of such algorithms is the trade-off between precision and speed of the analysis. ...doi:10.1007/3-540-45789-5_15 fatcat:mufinojryfcefam7lyqjwhi6ay
Aviv); Nisan, Noam (IL-HEBR-C; Jerusalem) ; Vishkin, Uzi (1-MD-CS; College Park, MD) Trade-offs between communication throughput and parallel time. ... Our goal is to deter- mine which variant of the push-relabel method is most efficient in practice and to compare push-relabel algorithms with augment- ing path algorithms. ...
Mach. 36 (1989), no. 3, 510-530] have presented space vs. efficiency trade-offs for general Antal Ivdnyi (Budapest) networks with unit cost edges. 91e:68020 68M15 Gelenbe, Erol (F-PARIS5); Hernandez, Marisela ... Summary: “We consider the following communication problem: Each vertex of an undirected graph possesses a unique piece of in- formation which must be sent to every other vertex in the graph. ...
The graph-based methods can be computationally amongst the most efficient ones, while maintaining the retrieval performance. ... In this paper, we explore a novel unsupervised approach which merges parts of a document in sequential form, prior to construction of the token graph. ... The work was also supported by the Ministry of Culture of Republic of Slovenia through project Development of Slovene in Digital Environment (RSDO). ...arXiv:2208.07262v1 fatcat:edpmpetgijf5rclvzkj5zlz4qu
Summary: “In this paper we propose a family of algorithms com- bining tree-clustering with conditioning that trade space for time. ... Our pruning technique uses the m previous moves to decide if a move is rele- vant in the current context and, if not, to cut it off. ...
In addition, an efficient parametric linear programming algorithm to compute the trade-off curve of the relaxed problem is given. ... Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. ... Kuipers for computing the exact trade-off curves with SAMCRA. ...doi:10.1109/infocom.2006.263 dblp:conf/infocom/MieghemV06 fatcat:qyhezupr6ncurfyr4z6ndczspa
« Previous Showing results 1 — 15 out of 42,775 results