Results 21 to 30 of about 4,174,426 (295)
Round Compression for Parallel Matching Algorithms [PDF]
, 2018 For over a decade now we have been witnessing the success of {\em massive parallel computation} (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark.
Czumaj, Artur +5 more
core +3 more sources
Algorithms for storytelling [PDF]
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, 2006 We formulate a new data mining problem called storytelling as a generalization of redescription mining. In traditional redescription mining, we are given a set of objects and a collection of subsets defined over these objects. The goal is to view the set system as a vocabulary and identify two expressions in this vocabulary that induce the same set of ...
Deept Kumar +3 more
openaire +2 more sources
Acknowledgement to Reviewers of Algorithms in 2016
Algorithms, 2017 The editors of Algorithms would like to express their sincere gratitude to the following reviewers for assessing manuscripts in 2016.[...]
Algorithms Editorial Office
doaj +1 more source
On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$.
Nicolas Bédaride +3 more
doaj +1 more source
Acknowledgement to Reviewers of Algorithms in 2017
Algorithms, 2018 Peer review is an essential part in the publication process, ensuring that Algorithms maintains high quality standards for its published papers.[...]
Algorithms Editorial Office
doaj +1 more source
Constrained ear decompositions in graphs and digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a ...
Frédéric Havet, Nicolas Nisse
doaj +1 more source
, 2013 One of the central questions in free speech jurisprudence is what activities the First Amendment encompasses. This Article considers that question in the context of an area of increasing importance – algorithm-based decisions.
Bolin, Malin, Nordin, Maria
core +2 more sources
On Bioelectric Algorithms [PDF]
, 2019 Cellular bioelectricity describes the biological phenomenon in which cells in living tissue generate and maintain patterns of voltage gradients across their membranes induced by differing concentrations of charged ions.
Gilbert, Seth +2 more
core +1 more source
Development of an early alert model for pandemic situations in Germany
Scientific Reports, 2023 The COVID-19 pandemic has pointed out the need for new technical approaches to increase the preparedness of healthcare systems. One important measure is to develop innovative early warning systems.
Danqi Wang +9 more
doaj +1 more source
Parameterized Distributed Algorithms [PDF]
, 2018 In this work, we initiate a thorough study of graph optimization problems parameterized by the output size in the distributed setting. In such a problem, an algorithm decides whether a solution of size bounded by k exists and if so, it finds one.
Ben-Basat, Ran +2 more
core +2 more sources