Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Georgios Varisteas

dblp:141/0283 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Systems, architecture and hardware · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 61% Parallel and multicore computing · 39%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › performance model construction › memory system performance modeling
contention modeling
0.312017
Pandia: comprehensive contention-sensitive thread placement · EuroSys 2017
Parallel and multicore computing › task allocation
thread placement
0.312017
Pandia: comprehensive contention-sensitive thread placement · EuroSys 2017
Performance modeling and evaluation
workload characterization
0.312017
Pandia: comprehensive contention-sensitive thread placement · EuroSys 2017
YearPublicationVenuePosition
2020 Leveraging Privileged Information to Limit Distraction in End-to-End Lane Following
abstract
Convolutional Neural Networks have been successfully used to steer vehicles using only road-facing cameras. In this work, we investigate the use of Privileged Information for training an end-to-end lane following model. Starting from the prior assumption that such a model should spend a sizeable fraction of its focus on lane markings, we take advantage of lane geometry information available at training time to improve its performance. To this end, we constrain the class of learnable functions by imposing a prior stemming from a lane segmentation task. For each input frame, we compute the set of pixels that most contribute to the prediction of the model using the VisualBackProp method. These pixel-relevance heatmaps are then compared with ground truth lane segmentation masks. A Distraction Loss term is added to the objective to regularize the training process. We learn from real-world data collected using our experimental vehicle and compare the results to those obtained using the simple Mean Squared Error objective. We show that the presence of our regularizer benefits both the performance and the stability of the model across a variety of evaluation metrics. We use a pretrained lane segmentation model without fine-tuning to extract lane marking masks and show that valuable learning signals can be extracted even from imperfect privileged knowledge. This method can be implemented easily and very efficiently on top of an existing architecture, without requiring the addition of any trainable parameter.
François Robinet, Antoine Demeules, Raphaël Frank, Georgios Varisteas, Christian Hundt 0002
CCNC4
2019 time series modelling of market price in real-time bidding
Manxing Du, Christian A. Hammerschmidt, Georgios Varisteas, Radu State, Mats Brorsson
ESANN3
2018 Detecting malicious authentication events trustfully
abstract
Anomaly detection on security logs is receiving more and more attention. Authentication events are an important component of security logs, and being able to produce trustful and accurate predictions minimizes the effort of cyber-experts to stop false attacks. Observed events are classified into Normal, for legitimate user behavior, and Malicious, for malevolent actions. These classes are consistently excessively imbalanced which makes the classification problem harder; in the commonly used Los Alamos dataset, the malicious class comprises only 0.00033% of the total. This work proposes a novel method to extract advanced composite features, and a supervised learning technique for classifying authentication logs trustfully; the models are Random Forest, LogitBoost, Logistic Regression, and ultimately Majority Voting which leverages the predictions of the previous models and gives the final prediction for each authentication event. We measure the performance of our experiments by using the False Negative Rate and False Positive Rate. In overall we achieve 0 False Negative Rate (i.e. no attack was missed), and on average a False Positive Rate of 0.0019.
Georgios Kaiafas, Georgios Varisteas, Sofiane Lagraa, Radu State, Duy Cu Nguyen, Thorsten Ries, Mohamed Ourdane
NOMS2
2017 Improving Real-Time Bidding Using a Constrained Markov Decision Process
Manxing Du, Redouane Sassioui, Georgios Varisteas, Radu State, Mats Brorsson, Omar Cherkaoui
ADMA3
2017 Pandia: comprehensive contention-sensitive thread placement
abstract
Pandia is a system for modeling the performance of in-memory parallel workloads. It generates a description of a workload from a series of profiling runs, and combines this with a description of the machine's hardware to model the workload's performance over different thread counts and different placements of those threads.
Georgios Varisteas, Tim Harris 0001
EuroSys2
2016 Palirria: accurate on-line parallelism estimation for adaptive work-stealing
abstract
Summary We present Palirria, a self‐adapting work‐stealing scheduling method for nested fork/join parallelism that can be used to estimate the number of utilizable workers and self‐adapt accordingly. The estimation mechanism is optimized for accuracy, minimizing the requested resources without degrading performance. We implemented Palirria for both the Linux and Barrelfish operating systems and evaluated it on two platforms: a 48‐core Non‐Uniform Memory Access (NUMA) multiprocessor and a simulated 32‐core system. Compared with state‐of‐the‐art, we observed higher accuracy in estimating resource requirements. This leads to improved resource utilization and performance on par or better to executing with fixed resource allotments. Copyright © 2015 John Wiley & Sons, Ltd.
Georgios Varisteas, Mats Brorsson
Concurr. Comput. Pract. Exp.1