Please login to be able to save your searches and receive alerts for new content matching your search criteria.
KASTEL, Germany
,ETH Zurich, Switzerland
,ETH Zurich, Switzerland
,KASTEL, Germany
,University of Applied Sciences, Germany
,IAM-MMS, Germany
,KASTEL, Germany
,ETH Zurich, Switzerland
The many configuration options of modern applications make it difficult for users to select a performance-optimal configuration. Performance models help users in understanding system performance and choosing a fast configuration. Existing performance ...
ETH Zurich, Switzerland
,IIT Tirupati, India
,ETH Zurich, Switzerland
,King Mongkut's University of Technology North Bangkok, Thailand
,Technical University of Ostrava, Czech Republic
,ETH Zurich, Switzerland
,AGH-UST, Poland
,ETH Zurich, Switzerland
,ETH Zurich, Switzerland
,ETH Zurich, Switzerland
,ETH Zurich, Switzerland
,ETH Zurich, Switzerland
,ETH Zurich, Switzerland
,ETH Zurich, Switzerland
,ETH Zurich, Switzerland
,ETH Zurich, Switzerland
,AGH-UST, Poland
,ETH Zurich, Switzerland
,ETH Zurich, Switzerland
Simple graph algorithms such as PageRank have been the target of numerous hardware accelerators. Yet, there also exist much more complex graph mining algorithms for problems such as clustering or maximal clique listing. These algorithms are memory-...
ETH Zurich
,ETH Zurich
,ETH Zurich
,Future Processing SA
,ETH Zurich
Function-as-a-Service (FaaS) is one of the most promising directions for the future of cloud services, and serverless functions have immediately become a new middleware for building scalable and cost-efficient microservices and appli cations. However, ...
ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
,VSB, Ostrava, Czech Republic
,AGH-UST, Krakow, Poland
,ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
,AGH-UST, Krakow, Poland
,ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
We propose GraphMineSuite (GMS): the first benchmarking suite for graph mining that facilitates evaluating and constructing high-performance graph mining algorithms. First, GMS comes with a benchmark specification based on extensive literature review, ...
ETH Zurich, Zurich, Switzerland
,ETH Zurich, Zurich, Switzerland
,University of Edinburgh, Edinburgh, United Kindgom
,ETH Zurich, Zurich, Switzerland
,Technical University of Darmstadt, Darmstadt, Germany
,ETH Zurich, Zurich, Switzerland
Performance models are well-known instruments to understand the scaling behavior of parallel applications. They express how performance changes as key execution parameters, such as the number of processes or the size of the input problem, vary. Besides ...
RWTH Aachen University, Germany
,RWTH Aachen University, Germany
,RWTH Aachen University, Germany
In this paper, we present a generalized version of the matrix chain algorithm to generate efficient code for linear algebra problems, a task for which human experts often invest days or even weeks of works. The standard matrix chain problem consists in ...
RWTH Aachen University, Aachen, Germany
,Center for Computation and Technology, Louisiana State University, Baton Rouge, USA and The STELLAR Group, Baton Rouge, USA
The recent advancements in High Performance Computing and ongoing research to reach Exascale has been heavily supported by introducing dedicated massively parallel accelerators. Programmers wishing to maximize utilization of current supercomputers are ...
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.
Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.
A direct search interface for Author Profiles will be built.
An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.
It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.
The ACM DL is a comprehensive repository of publications from the entire field of computing.
It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.
ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.
Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.
ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.
To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.
Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.
The Service can be applied to all the articles you have ever published with ACM.
Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.
For authors who do not have a free ACM Web Account:
For authors who have an ACM web account, but have not edited their ACM Author Profile page:
For authors who have an account and have already edited their Profile Page:
ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.
Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.
We are preparing your search results for download ...
We will inform you here when the file is ready.
Download now!Your file of search results citations is now ready.
Download now!