Search

Your search keyword '"Laura, Luigi"' showing total 211 results
Start Over Author "Laura, Luigi" Search Limiters Peer Reviewed Publication Year Range Last 50 years
211 results on '"Laura, Luigi"'

1. Bridging the AI Knowledge Gap with Open Online Education in Europe

Author

Assante, Dario, Fornaro, Claudio, Laura, Luigi, Pirrone, Daniele, Gokdemir, Ali, Jecheva, Veselina, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Auer, Michael E., editor, Langmann, Reinhard, editor, May, Dominik, editor, and Roos, Kim, editor

Published
2024
Full Text
View/download PDF

2. Complexity-based partitioning of CSFI problem instances with Transformers

Author

Benedetto, Luca, Fantozzi, Paolo, and Laura, Luigi

Subjects
Computer Science - Machine Learning
Abstract

In this paper, we propose a two-steps approach to partition instances of the Conjunctive Normal Form (CNF) Syntactic Formula Isomorphism problem (CSFI) into groups of different complexity. First, we build a model, based on the Transformer architecture, that attempts to solve instances of the CSFI problem. Then, we leverage the errors of such model and train a second Transformer-based model to partition the problem instances into groups of different complexity, thus detecting the ones that can be solved without using too expensive resources. We evaluate the proposed approach on a pseudo-randomly generated dataset and obtain promising results. Finally, we discuss the possibility of extending this approach to other problems based on the same type of textual representation.

Published
2021

3. A Theoretical Framework for Computer Vision Learning Environment

Author

Laura, Luigi, Miloso, Antonio, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, González-González, Carina S., editor, Fernández-Manjón, Baltasar, editor, Li, Frederick, editor, García-Peñalvo, Francisco José, editor, Sciarrone, Filippo, editor, Spaniol, Marc, editor, García-Holgado, Alicia, editor, Area-Moreira, Manuel, editor, Hemmje, Matthias, editor, and Hao, Tianyong, editor

Published
2023
Full Text
View/download PDF

5. Age and Gender (Face) Recognition: A Brief Survey

Author

Di Mascio, Tania, Fantozzi, Paolo, Laura, Luigi, Rughetti, Valerio, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, De la Prieta, Fernando, editor, Gennari, Rosella, editor, Temperini, Marco, editor, Di Mascio, Tania, editor, Vittorini, Pierpaolo, editor, Kubincova, Zuzana, editor, Popescu, Elvira, editor, Rua Carneiro, Davide, editor, Lancia, Loreto, editor, and Addone, Agnese, editor

Published
2022
Full Text
View/download PDF

6. Non-isomorphic CNF Generation

Author

Fantozzi, Paolo, Laura, Luigi, Nanni, Umberto, Villa, Alessandro, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Matsui, Kenji, editor, Omatu, Sigeru, editor, Yigitcanlar, Tan, editor, and González, Sara Rodríguez, editor

Published
2022
Full Text
View/download PDF

8. Collaborative Recommendations in Online Judges Using Autoencoder Neural Networks

Author

Fantozzi, Paolo, Laura, Luigi, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Dong, Yucheng, editor, Herrera-Viedma, Enrique, editor, Matsui, Kenji, editor, Omatsu, Shigeru, editor, González Briones, Alfonso, editor, and Rodríguez González, Sara, editor

Published
2021
Full Text
View/download PDF

9. A Dynamic Recommender System for Online Judges Based on Autoencoder Neural Networks

Author

Fantozzi, Paolo, Laura, Luigi, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Kubincová, Zuzana, editor, Lancia, Loreto, editor, Popescu, Elvira, editor, Nakayama, Minoru, editor, Scarano, Vittorio, editor, and Gil, Ana B., editor

Published
2021
Full Text
View/download PDF

10. On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications

Author

Georgiadis, Loukas, Karanasiou, Aikaterini, Konstantinos, Giannis, and Laura, Luigi

Subjects
Computer Science - Data Structures and Algorithms
Abstract

A flow graph $G=(V,E,s)$ is a directed graph with a distinguished start vertex $s$. The dominator tree $D$ of $G$ is a tree rooted at $s$, such that a vertex $v$ is an ancestor of a vertex $w$ if and only if all paths from $s$ to $w$ include $v$. The dominator tree is a central tool in program optimization and code generation and has many applications in other diverse areas including constraint programming, circuit testing, biology, and in algorithms for graph connectivity problems. A low-high order of $G$ is a preorder $\delta$ of $D$ that certifies the correctness of $D$ and has further applications in connectivity and path-determination problems. In this paper, we first consider how to maintain efficiently a low-high order of a flow graph incrementally under edge insertions. We present algorithms that run in $O(mn)$ total time for a sequence of $m$ edge insertions in an initially empty flow graph with $n$ vertices.These immediately provide the first incremental certifying algorithms for maintaining the dominator tree in $O(mn)$ total time, and also imply incremental algorithms for other problems. Hence, we provide a substantial improvement over the $O(m^2)$ simple-minded algorithms, which recompute the solution from scratch after each edge insertion. We also show how to apply low-high orders to obtain a linear-time $2$-approximation algorithm for the smallest $2$-vertex-connected spanning subgraph problem (2VCSS). Finally, we present efficient implementations of our new algorithms for the incremental low-high and 2VCSS problems and conduct an extensive experimental study on real-world graphs taken from a variety of application areas. The experimental results show that our algorithms perform very well in practice.

Published
2016

12. Recommending Tasks in Online Judges

Author

Audrito, Giorgio, Di Mascio, Tania, Fantozzi, Paolo, Laura, Luigi, Martini, Gemma, Nanni, Umberto, Temperini, Marco, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Gennari, Rosella, editor, Vittorini, Pierpaolo, editor, De la Prieta, Fernando, editor, Di Mascio, Tania, editor, Temperini, Marco, editor, Azambuja Silveira, Ricardo, editor, and Ovalle Carranza, Demetrio Arturo, editor

Published
2020
Full Text
View/download PDF

15. An Experimental Study of Dynamic Dominators

Author

Georgiadis, Loukas, Italiano, Giuseppe F., Laura, Luigi, and Santaroni, Federico

Subjects
Computer Science - Data Structures and Algorithms
Abstract

Motivated by recent applications of dominator computations, we consider the problem of dynamically maintaining the dominators of flow graphs through a sequence of insertions and deletions of edges. Our main theoretical contribution is a simple incremental algorithm that maintains the dominator tree of a flow graph with $n$ vertices through a sequence of $k$ edge insertions in $O(m\min\{n,k\}+kn)$ time, where $m$ is the total number of edges after all insertions. Moreover, we can test in constant time if a vertex $u$ dominates a vertex $v$, for any pair of query vertices $u$ and $v$. Next, we present a new decremental algorithm to update a dominator tree through a sequence of edge deletions. Although our new decremental algorithm is not asymptotically faster than repeated applications of a static algorithm, i.e., it runs in $O(mk)$ time for $k$ edge deletions, it performs well in practice. By combining our new incremental and decremental algorithms we obtain a fully dynamic algorithm that maintains the dominator tree through intermixed sequence of insertions and deletions of edges. Finally, we present efficient implementations of our new algorithms as well as of existing algorithms, and conduct an extensive experimental study on real-world graphs taken from a variety of application areas., Comment: A preliminary version of this paper appeared in Proc. ESA 2012

Published
2016

18. Dynamic subtrees queries revisited: the Depth First Tour Tree

Author

Farina, Gabriele and Laura, Luigi

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In the dynamic tree problem the goal is the maintenance of an arbitrary n-vertex forest, where the trees are subject to joining and splitting by, respectively, adding and removing edges. Depending on the application, information can be associated to nodes or edges (or both), and queries might require to combine values in path or (sub)trees. In this paper we present a novel data structure, called the Depth First Tour Tree, based on a linearization of a DFS visit of the tree. Despite the simplicity of the approach, similar to the ET-Trees (based on a Euler Tour), our data structure is able to answer queries related to both paths and (sub)trees. In particular, focusing on subtree computations, we show how to customize the data structure in order to answer queries for three distinct applications: impact of the removal of an articulation point from a graph, betweenness centrality and closeness centrality of a dynamic tree.

Published
2015

19. 2-Vertex Connectivity in Directed Graphs

Author

Georgiadis, Loukas, Italiano, Giuseppe F., Laura, Luigi, and Parotsidis, Nikos

Subjects
Computer Science - Data Structures and Algorithms
Abstract

We complement our study of 2-connectivity in directed graphs, by considering the computation of the following 2-vertex-connectivity relations: We say that two vertices v and w are 2-vertex-connected if there are two internally vertex-disjoint paths from v to w and two internally vertex-disjoint paths from w to v. We also say that v and w are vertex-resilient if the removal of any vertex different from v and w leaves v and w in the same strongly connected component. We show how to compute the above relations in linear time so that we can report in constant time if two vertices are 2-vertex-connected or if they are vertex-resilient. We also show how to compute in linear time a sparse certificate for these relations, i.e., a subgraph of the input graph that has O(n) edges and maintains the same 2-vertex-connectivity and vertex-resilience relations as the input graph, where n is the number of vertices., Comment: arXiv admin note: substantial text overlap with arXiv:1407.3041

Published
2014

20. Collaborative Language Learning Through Computer-Assisted Translation on a Wiki-Based Platform: Operations and Management

Author

Baraniello, Vincenzo, Laura, Luigi, Naldi, Maurizio, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Di Mascio, Tania, editor, Vittorini, Pierpaolo, editor, Gennari, Rosella, editor, De la Prieta, Fernando, editor, Rodríguez, Sara, editor, Temperini, Marco, editor, Azambuja Silveira, Ricardo, editor, Popescu, Elvira, editor, and Lancia, Loreto, editor

Published
2019
Full Text
View/download PDF

21. 2-Edge Connectivity in Directed Graphs

Author

Georgiadis, Loukas, Italiano, Giuseppe F., Laura, Luigi, and Parotsidis, Nikos

Subjects
Computer Science - Data Structures and Algorithms
Abstract

Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly not much has been investigated for directed graphs. In this paper we study $2$-edge connectivity problems in directed graphs and, in particular, we consider the computation of the following natural relation: We say that two vertices $v$ and $w$ are $2$-edge-connected if there are two edge-disjoint paths from $v$ to $w$ and two edge-disjoint paths from $w$ to $v$. This relation partitions the vertices into blocks such that all vertices in the same block are $2$-edge-connected. Differently from the undirected case, those blocks do not correspond to the $2$-edge-connected components of the graph. We show how to compute this relation in linear time so that we can report in constant time if two vertices are $2$-edge-connected. We also show how to compute in linear time a sparse certificate for this relation, i.e., a subgraph of the input graph that has $O(n)$ edges and maintains the same $2$-edge-connected blocks as the input graph.

Published
2014

22. Experimental Evaluation of Algorithms for the Food-Selection Problem

Author

Demetrescu, Camil, Finocchi, Irene, Italiano, Giuseppe F., and Laura, Luigi

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In this paper, we describe the result of our experiments on Algorithms for the Food-Selection Problem, which is the fundamental problem first stated and addressed in the seminal paper \cite{pigout}. Because the key aspect of any experimental evaluation is the \textbf{reproducibility}, we detail deeply the setup of all our experiments, thus leaving to the interested eater the opportunity to reproduce all the results described in this paper. More specifically, we describe all the answers we provided to the questions proposed in \cite{pigout}: Where can I have dinner tonight? What is the typical Roman cuisine that I should (not) miss? Where can I find the best coffee or gelato in town?, Comment: This paper discuss the problem of eating good food in Rome :-) This is the latest version, the one that has been distributed to people participants of the SEA 2013 conference. Previous versions of this paper have been distributed to participants of FOCS 2004, CIAC 2006, ICTCS 2007, WEA 2007, WINE 2009, OPODIS 2012, and WSDM 2013

Published
2014

24. Real-Time Monitoring of Undirected Networks: Articulation Points, Bridges, and Connected and Biconnected Components

Author

Ausiello, Giorgio, Firmani, Donatella, and Laura, Luigi

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In this paper we present the first algorithm in the streaming model to characterize completely the biconnectivity properties of undirected networks: articulation points, bridges, and connected and biconnected components. The motivation of our work was the development of a real-time algorithm to monitor the connectivity of the Autonomous Systems (AS) Network, but the solution provided is general enough to be applied to any network. The network structure is represented by a graph, and the algorithm is analyzed in the datastream framework. Here, as in the \emph{on-line} model, the input graph is revealed one item (i.e., graph edge) after the other, in an on-line fashion; but, if compared to traditional on-line computation, there are stricter requirements for both memory occupation and per item processing time. Our algorithm works by properly updating a forest over the graph nodes. All the graph (bi)connectivity properties are stored in this forest. We prove the correctness of the algorithm, together with its space ($O(n\,\log n)$, with $n$ being the number of nodes in the graph) and time bounds. We also present the results of a brief experimental evaluation against real-world graphs, including many samples of the AS network, ranging from medium to massive size. These preliminary experimental results confirm the effectiveness of our approach.

Published
2012
Full Text
View/download PDF

30. Three Uses of the Online Social Programming Training System: On Nature and Purpose of Spreading Algorithmic Problem Solving

Author

Di Luigi, William, Farina, Gabriele, Laura, Luigi, Nanni, Umberto, Temperini, Marco, Versari, Luca, Huang, Ronghuai, Series editor, Kinshuk, Series editor, Jemni, Mohamed, Series editor, Chen, Nian-Shing, Series editor, Spector, J. Michael, Series editor, Li, Yanyan, editor, Chang, Maiga, editor, Kravcik, Milos, editor, and Popescu, Elvira, editor

Published
2016
Full Text
View/download PDF

31. A Wiki-Based Approach to Computer-Assisted Translation for Collaborative Language Learning

Author

Baraniello, Vincenzo, Degano, Chiara, Laura, Luigi, Zahonero, María Lozano, Naldi, Maurizio, Petroni, Sandra, Huang, Ronghuai, Series editor, Kinshuk, Series editor, Jemni, Mohamed, Series editor, Chen, Nian-Shing, Series editor, Spector, J. Michael, Series editor, Li, Yanyan, editor, Chang, Maiga, editor, Kravcik, Milos, editor, and Popescu, Elvira, editor

Published
2016
Full Text
View/download PDF

33. Dynamic Subtrees Queries Revisited: The Depth First Tour Tree

Author

Farina, Gabriele, Laura, Luigi, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Lipták, Zsuzsanna, editor, and Smyth, William F., editor

Published
2016
Full Text
View/download PDF

34. Recommending Tasks in Online Judges

Author

Audrito, Giorgio, primary, Di Mascio, Tania, additional, Fantozzi, Paolo, additional, Laura, Luigi, additional, Martini, Gemma, additional, Nanni, Umberto, additional, and Temperini, Marco, additional

Published
2019
Full Text
View/download PDF

37. 2-Vertex Connectivity in Directed Graphs

Author

Georgiadis, Loukas, Italiano, Giuseppe F., Laura, Luigi, Parotsidis, Nikos, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Halldórsson, Magnús M., editor, Iwama, Kazuo, editor, Kobayashi, Naoki, editor, and Speckmann, Bettina, editor

Published
2015
Full Text
View/download PDF

38. The (not so) Critical Nodes of Criminal Networks

Author

Firmani, Donatella, Italiano, Giuseppe F., Laura, Luigi, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Aiello, Luca Maria, editor, and McFarland, Daniel, editor

Published
2015
Full Text
View/download PDF

39. Justice as a Service

Author

Fantozzi Paolo, Laura Luigi, Nuzzo Antonio, and Piselli Riccardo

Subjects
Information technology, T58.5-58.64
Abstract

In this paper we address an emerging service, called Justice as a Service (JaaS), that has been defined as an on-demand service, powered by tech, that challenges private and public companies by representing the consumer in their fight for justice/compensation based on laws, consumers’ rights, and contract of carriage. Indeed, in recent years we have witnessed the birth of several JaaS companies, that are devoted to a certain type of claim such as compensation for flight delay or cancellation, or refunds for late shipping. However, as we will discuss in the paper, we do believe that these are only the first generation of JaaS systems, i.e. the ones that solve easy problems. The advances in Natural Language Processing models such as the very recent GPT-3, together with the availability of suits data in electronic form, will soon allow the rise of more complex systems, able either to assist lawyers in the preparation of cases or to assist the end user in more involved legal issues. In the paper, we discuss the technical and legal challenges of these new systems.

Published
2021
Full Text
View/download PDF

41. The Organization of Large-Scale Repositories of Learning Objects with Directed Hypergraphs

Author

Laura, Luigi, Nanni, Umberto, Temperini, Marco, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Cao, Yiwei, editor, Väljataga, Terje, editor, Tang, Jeff K.T., editor, Leung, Howard, editor, and Laanpere, Mart, editor

Published
2014
Full Text
View/download PDF

42. Probabilistic Inference in the Physical Simulation of Interdependent Critical Infrastructure Systems

Author

Franchin, Paolo, Laura, Luigi, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bondavalli, Andrea, editor, Ceccarelli, Andrea, editor, and Ortmeier, Frank, editor

Published
2014
Full Text
View/download PDF

43. Visual Analysis Based on Dominator Trees with Application to Personalized eLearning

Author

Laura, Luigi, Nanni, Umberto, Temperini, Marco, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Popescu, Elvira, editor, Lau, Rynson W. H., editor, Pata, Kai, editor, Leung, Howard, editor, and Laanpere, Mart, editor

Published
2014
Full Text
View/download PDF

44. Loop Nesting Forests, Dominators, and Applications

Author

Georgiadis, Loukas, Laura, Luigi, Parotsidis, Nikos, Tarjan, Robert E., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Kobsa, Alfred, editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Weikum, Gerhard, editor, Gudmundsson, Joachim, editor, and Katajainen, Jyrki, editor

Published
2014
Full Text
View/download PDF

46. Dominator Certification and Independent Spanning Trees: An Experimental Study

Author

Georgiadis, Loukas, Laura, Luigi, Parotsidis, Nikos, Tarjan, Robert E., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bonifaci, Vincenzo, editor, Demetrescu, Camil, editor, and Marchetti-Spaccamela, Alberto, editor

Published
2013
Full Text
View/download PDF

47. An Experimental Study of Dynamic Dominators

Author

Georgiadis, Loukas, Italiano, Giuseppe F., Laura, Luigi, Santaroni, Federico, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Epstein, Leah, editor, and Ferragina, Paolo, editor

Published
2012
Full Text
View/download PDF

48. Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs

Author

Ausiello, Giorgio, Italiano, Giuseppe F., Laura, Luigi, Nanni, Umberto, Sarracco, Fabiano, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Mahjoub, A. Ridha, editor, Markakis, Vangelis, editor, Milis, Ioannis, editor, and Paschos, Vangelis Th., editor

Published
2012
Full Text
View/download PDF

49. Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs

Author

Firmani, Donatella, Italiano, Giuseppe F., Laura, Luigi, Orlandi, Alessio, Santaroni, Federico, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Klasing, Ralf, editor

Published
2012
Full Text
View/download PDF

50. Computing Strongly Connected Components in the Streaming Model

Author

Laura, Luigi, Santaroni, Federico, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Marchetti-Spaccamela, Alberto, editor, and Segal, Michael, editor

Published
2011
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results