Outputs (114)

Approximating Fixation Probabilities in the Generalized Moran Process (2014)
Book Chapter
Mertzios, G. (2014). Approximating Fixation Probabilities in the Generalized Moran Process. In M. Kao (Ed.), Encyclopedia of algorithms (1-6). Springer Verlag. https://doi.org/10.1007/978-3-642-27848-8_596-1

Problem Definition Population and evolutionary dynamics have been extensively studied, usually with the assumption that the evolving population has no spatial structure. One of the main models in this area is the Moran process [17]. The initial popul... Read More about Approximating Fixation Probabilities in the Generalized Moran Process.

Multitolerance Graphs (2014)
Book Chapter
Mertzios, G. (2014). Multitolerance Graphs. In M. Kao (Ed.), Encyclopedia of algorithms (1-6). Springer Verlag. https://doi.org/10.1007/978-3-642-27848-8_684-1

Problem Definition Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. A graph G = (V, E) on n vertices is a tolerance graph if there exists a collection I = { Iv... Read More about Multitolerance Graphs.

Robust and Efficient Large-Large Table Outer Joins on Distributed Infrastructures (2014)
Book Chapter
Cheng, L., Kotoulas, S., Ward, T., & Theodoropoulos, G. (2014). Robust and Efficient Large-Large Table Outer Joins on Distributed Infrastructures. In F. Silva, I. Dutra, & V. S. Costa (Eds.), Euro-Par 2014 Parallel Processing : 20th International Conference, Porto, Portugal, August 25-29, 2014 ; proceedings (258-269). Springer Verlag. https://doi.org/10.1007/978-3-319-09873-9_22

Outer joins are ubiquitous in many workloads but are sensitive to load-balancing problems. Current approaches mitigate such problems caused by data skew by using (partial) replication. However, contemporary replication-based approaches (1) introduce... Read More about Robust and Efficient Large-Large Table Outer Joins on Distributed Infrastructures.

Multifaceted open social learner modelling (2014)
Book Chapter
Shi, L., Cristea, A., & Hadzidedic, S. (2014). Multifaceted open social learner modelling. In P. Elvira, R. W. Lau, K. Pata, H. Leung, & L. Mart (Eds.), Advances in Web-Based Learning – ICWL 2014, 13th International Conference, Tallinn, Estonia, August 14-17, 2014, Proceedings (32-42). Springer Verlag. https://doi.org/10.1007/978-3-319-09635-3_4

Open social learner modelling (OSLM) approaches are promoted in order to assist learners in self-directed and self-determined learning in a social context. Still, most approaches only focus on visualising learners’ performance, or providing complex t... Read More about Multifaceted open social learner modelling.

Temporal Network Optimization Subject to Connectivity Constraints (2013)
Book Chapter
Mertzios, G., Michail, O., Chatzigiannakis, I., & Spirakis, P. (2013). Temporal Network Optimization Subject to Connectivity Constraints. In F. V. Fomin, R. Freivalds, M. Kwiatkowska, & D. Peleg (Eds.), Automata, languages, and programming : 40th international colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, proceedings, part II (657-668). Springer Verlag. https://doi.org/10.1007/978-3-642-39212-2_57

In this work we consider temporal networks, i.e. networks defined by a labeling λ assigning to each edge of an underlying graph G a set of discrete time-labels. The labels of an edge, which are natural numbers, indicate the discrete time moments at w... Read More about Temporal Network Optimization Subject to Connectivity Constraints.

On the Recognition of Four-Directional Orthogonal Ray Graphs (2013)
Book Chapter
Felsner, S., Mertzios, G., & Mustata, I. (2013). On the Recognition of Four-Directional Orthogonal Ray Graphs. In K. Chatterjee, & J. Sgall (Eds.), Mathematical foundations of computer science 2013 : 38th international symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (373-384). Springer Verlag. https://doi.org/10.1007/978-3-642-40313-2_34

Orthogonal ray graphs are the intersection graphs of horizontal and vertical rays (i.e. half-lines) in the plane. If the rays can have any possible orientation (left/right/up/down) then the graph is a 4-directional orthogonal ray graph (4-DORG). Othe... Read More about On the Recognition of Four-Directional Orthogonal Ray Graphs.

FLBP: Fuzzy Local Binary Patterns (2013)
Book Chapter
Katsigiannis, S., Keramidas, E., & Maroulis, D. (2013). FLBP: Fuzzy Local Binary Patterns. In Local Binary Patterns: New Variants and Applications (149-175). Springer Verlag. https://doi.org/10.1007/978-3-642-39289-4_7

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (2013)
Book Chapter
Mertzios, G., & Spirakis, P. (2013). Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. In P. V. E. Boas, F. C. Groen, G. F. Italiano, J. Nawrocki, & H. Sack (Eds.), SOFSEM 2013 : theory and practice of computer science : 39th international conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 26-31, 2013. Proceedings (332-343). Springer Verlag. https://doi.org/10.1007/978-3-642-35843-2_29

The 3-coloring problem is well known to be NP-complete. It is also well known that it remains NP-complete when the input is restricted to graphs with diameter 4. Moreover, assuming the Exponential Time Hypothesis (ETH), 3-coloring can not be solved i... Read More about Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs.

A Real-Time Video Encoding Scheme Based on the Contourlet Transform (2013)
Book Chapter
Katsigiannis, S., Papaioannou, G., & Maroulis, D. (2013). A Real-Time Video Encoding Scheme Based on the Contourlet Transform. In Design and Architectures for Digital Signal Processing. https://doi.org/10.5772/51735

Strong Bounds for Evolution in Networks (2013)
Book Chapter
Mertzios, G., & Spirakis, P. (2013). Strong Bounds for Evolution in Networks. In F. V. Fomin, R. Freivalds, M. Kwiatkowska, & D. Peleg (Eds.), Automata, languages, and programming : 40th international colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, proceedings, part II (669-680). Springer Verlag. https://doi.org/10.1007/978-3-642-39212-2_58

This work extends what is known so far for a basic model of evolutionary antagonism in undirected networks (graphs). More specifically, this work studies the generalized Moran process, as introduced by Lieberman, Hauert, and Nowak [Nature, 433:312-31... Read More about Strong Bounds for Evolution in Networks.