Search Results - "David W. Matula"

Finite Precision Number Systems and Arithmetic

Authors: Peter Kornerup David W. Matula

Resource Type: eBook.

Subjects: Arithmetic--Foundations

Categories: MATHEMATICS / Arithmetic

Optimal Approximation of the 1/x Function using Chebyshev Polynomials and Magic Constants.

Authors: WALCZYK, CEZARY J. MOROZ, LEONID V. SAMOTYY, VOLODYMYR et al.

Source: ACM Transactions on Mathematical Software. Mar2025, Vol. 51 Issue 1, p1-38. 38p.

Revisiting Automatic Pipelining: Gate-level Forwarding and Speculation.

Authors: Cheng, Shuyao Li, Chongxiao Du, Zidong et al.

Source: DAC: Annual ACM/IEEE Design Automation Conference; 2024, Issue 61, p1388-1393, 6p

Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs.

Authors: BRESSAN, MARCO¹, marco.bressan@unimi.it

Source: ACM Transactions on Algorithms; Jul2023, Vol. 19 Issue 3, p1-40, 40p

Algorithm 1029: Encapsulated Error, a Direct Approach to Evaluate Floating-Point Accuracy.

Authors: DEMEURE, NESTOR CHEVALIER, CéDRIC DENIS, CHRISTOPHE et al.

Source: ACM Transactions on Mathematical Software. Dec2022, Vol. 48 Issue 4, p1-16. 16p.

ABSTRACTS from other ACM Publications.

Source: Communications of the ACM; Oct82, Vol. 25 Issue 10, p748-753, 6p

Near-optimal Distributed Triangle Enumeration via Expander Decompositions.

Authors: YI-JUN CHANG PETTIE, SETH SARANURAK, THATCHAPHOL et al.

Source: Journal of the ACM. May2021, Vol. 68 Issue 3, p1-36. 36p.

Bounds on maximum concurrent flow in random bipartite graphs.

Authors: Vilas, Fernando E. Olinick, Eli V. Matula, David W.

Source: Optimization Letters. Nov2020, Vol. 14 Issue 8, p2197-2209. 13p.

acm forum.

Source: Communications of the ACM; Apr1975, Vol. 18 Issue 4, p240-242, 3p

Faithfully Rounded Floating-point Computations.

Authors: LANGE, MARKO RUMP, SIEGFRIED M.

Source: ACM Transactions on Mathematical Software. Jul2020, Vol. 46 Issue 3, p1-20. 20p.

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.

Authors: LOKSHTANOV, DANIEL PANOLAN, FAHAD SAURABH, SAKET et al.

Source: ACM Transactions on Algorithms; May2020, Vol. 16 Issue 3, p1-31, 31p

Subtree Isomorphism Revisited.

Authors: ABBOUD, AMIR BACKURS, ARTURS HANSEN, THOMAS DUEHOLM et al.

Source: ACM Transactions on Algorithms; Jun2018, Vol. 14 Issue 3, p1-23, 23p

A Critical Survey of the Multilevel Method in Complex Networks.

Authors: VALEJO, ALAN FERREIRA, VINÍCIUS FABBRI, RENATO et al.

Source: ACM Computing Surveys. Mar2021, Vol. 53 Issue 2, p1-35. 35p.

A compact linear programming formulation of the maximum concurrent flow problem.

Authors: Dong, Yuanyuan Olinick, Eli V. Jason Kratz, T. et al.

Source: Networks. Jan2015, Vol. 65 Issue 1, p68-87. 40p.

An algorithm for finding all the k -components of a digraph.

Authors: Makino, Seishi¹

Source: International Journal of Computer Mathematics. Jan1988, Vol. 24 Issue 3/4, p213-221. 9p.

acm forum.

Authors: McCarthy, John Anderson, D. B. Matula, David W. et al.

Source: Communications of the ACM; May75, Vol. 18 Issue 5, p300-305, 6p

Graph Algorithms And Applications 3

Authors: Giuseppe Liotta Roberto Tamassia Ioannis G Tollis

Resource Type: eBook.

Subjects: Graph theory, Graph algorithms

Categories: MATHEMATICS / Graphic Methods, COMPUTERS / Programming / Algorithms, COMPUTERS / Computer Engineering

Efficient Frequent Subtree Mining Beyond Forests

Authors: Pascal Welke

Resource Type: eBook.

Subjects: Data mining

Categories: COMPUTERS / Artificial Intelligence / General