Erich Schikuta

Erich Schikuta

Auto-generated profile, based on publicly available information

Erich Schikuta

Faculty of Computer Science University of Vienna Vienna Austria

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1996
Verified
Conference Paper
Closed access
ESE. Schikuta
E. Schikuta
Clustering is a common technique for the analysis of large images. In this paper a new approach to hierarchical clustering of very large data sets is presented. The GRIDCLUS algorithm uses a multidimensional grid data structure to organize the value space surrounding the pattern values, rather than to organize the patterns themselves. The patterns are grouped into blocks and clustered with respect to the blocks by a topological neighbor search algorithm. The runtime behavior of the algorithm outperforms all conventional hierarchical methods. A comparison of execution times to those of other commonly used clustering algorithms, and a heuristic runtime analysis are presented.

1 January 2013 in Procedia Computer Science
Verified
Journal Article
Open access
AHAltaf Ahmad Huqqani
Altaf Ahmad Huqqani
ESErich Schikuta
Erich Schikuta
SYSicen Ye
Sicen Ye
PCPeng Chen
Peng Chen
Training of Artificial Neural Networks for large data sets is a time consuming task. Various approaches have been proposed to reduce the efforts, many of them by applying parallelization techniques. In this paper we develop and analyze two novel parallel training approaches for Backpropagation neural networks for face recognition. We focus on two specific paralleliza- tion environments, using on the one hand OpenMP on a conventional multithreaded CPU and CUDA on a GPU. Based on our findings we give guidelines for the efficient parallelization of Backpropagation neural networks on multicore and GPU architectures.Additionally, we present a traversal method finding the best combination of learning rate and momentum term by varying the number of hidden neurons supporting the parallelization efforts

1 October 2016 in Computer Networks
Verified
Journal Article
Closed access
ABArian Baer
Arian Baer
PCPedro Casas
Pedro Casas
ADAlessandro D’alconzo
Alessandro D’alconzo
PFPierdomenico Fiadino
Pierdomenico Fiadino
LGLukasz Golab
Lukasz Golab
ESErich Schikuta
Erich Schikuta

1 September 2009
Verified
Conference Paper
Closed access
KKKevin Kofler
Kevin Kofler
IHIrfan Ul Haq
Irfan Ul Haq
ESErich Schikuta
Erich Schikuta
Automated composition and optimization of workflows in service-enriched environments is a challenging research area with strong implications in globally distributed systems such as Grid Computing and Cloud Computing. A workflow is composed of web services selected in accordance with user requirements. A strong formal realization of the problem is inevitable to ensure efficiency based on various interdependent parameters. We devise a mathematical model in order to map abstract workflows into concrete workflows satisfying user requirements represented by QoS parameters. Our model, which is based on the Multidimensional Multi-choice Knapsack Problem (MMKP), defines a happiness measure, that takes into account these requirements as well as the weights given to each requirement by the user. Then we develop a parallelizable branch and bound algorithm to maximize this happiness measure. We incorporate the Kepler Workflow tool, CORBA and C++ based optimization components to simulate two versions of the algorithm: a sequential version and a parallel version. We also indicate how to use heuristics to reuse the results of the parallel optimization under dynamic changes in requirements or service availability. Finally, we show a speedup analysis of our implementation.

1 January 2011 in Procedia Computer Science
Verified
Journal Article
Open access
EVElisabeth Vinek
Elisabeth Vinek
PBPeter Paul Beran
Peter Paul Beran
ESErich Schikuta
Erich Schikuta
In distributed systems, where several deployments of a specific service exist, it is a crucial task to select and combine concrete deployments to build an executable workflow. Non-functional properties such as performance and availability are taken into account in such selection processes that are designed to reach certain objectives while meeting constraints. In this paper, a concrete data-intensive application scenario from a High-Energy Physics experiment comprising a deployment selection challenge is introduced. A generic model for distributed systems is presented based on which a formal model representing the individual components of the system is derived. The optimization problem is approached both from the angle of the user and the angle of the system provider. Moreover the dynamic aspects of the underlying system are taken into account. This results in a dynamic multi-objective optimization problem for which an explicit memory-based genetic algorithm is proposed

20 August 2008 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
ESErich Schikuta
Erich Schikuta
HWHelmut Wanek
Helmut Wanek
IHIrfan Ul Haq
Irfan Ul Haq