Abstract: The invention notably relates to a computer-implemented method for completing an image having at least one hole, the method comprising providing a dictionary of atoms representative of the known part of the image; determining an optimal distribution of atom linear combinations with a process comprising at least one minimization of a respective energy defined on a respective Markov Random Field having nodes and labels, each node corresponding to a respective location of the hole and being associated to a respective label; and filling the hole with the optimal distribution. The invention improves the field of image completion.

Abstract: The invention notably relates to a computer-implemented method of clustering reference queries in a database for prediction of the runtime of a target query in the database based on similarity of the target query with the reference queries. The method comprises providing a number of numerical values that represent the runtimes of the reference queries; computing the optimal K-means clustering of the numerical values for a predetermined number of clusters, wherein the computing includes iterating, a number of times corresponding to the predetermined number of clusters, a linear-time Row Minima Searching algorithm applied to a square matrix of order equal to the number of numerical values; and clustering the reference queries according to the computed clustering of the numerical values. Such a method improves the field of database query runtime prediction.

Abstract: The invention notably relates to a computer-implemented method of designing a choropleth map, wherein the method comprises providing a map, and a number (n) of numerical values (x1, . . . , xn) that represent a statistical variable at respective areas of the map; computing the optimal K-means clustering of the numerical values for a predetermined number of clusters, wherein the computing includes iterating, a number of times corresponding to the predetermined number of clusters, a linear-time Row Minima Searching algorithm applied to a square matrix of order equal to the number of numerical values; assigning a respective coloration to each cluster of the computed clustering; and at all areas of the map at which a respective numerical value is provided, applying the coloration assigned to the cluster to which the respective numerical value belongs. Such a method improves the design of a choropleth map.

Abstract: The invention notably relates to a computer-implemented method for completing an image having at least one hole, the method comprising providing a dictionary of atoms representative of the known part of the image; determining an optimal distribution of atom linear combinations with a process comprising at least one minimization of a respective energy defined on a respective Markov Random Field having nodes and labels, each node corresponding to a respective location of the hole and being associated to a respective label; and filling the hole with the optimal distribution. The invention improves the field of image completion.

Abstract: The invention notably relates to a computer-implemented method of designing a choropleth map, wherein the method comprises providing a map, and a number (n) of numerical values (x1, . . . , xn) that represent a statistical variable at respective areas of the map; computing the optimal K-means clustering of the numerical values for a predetermined number of clusters, wherein the computing includes iterating, a number of times corresponding to the predetermined number of clusters, a linear-time Row Minima Searching algorithm applied to a square matrix of order equal to the number of numerical values; assigning a respective coloration to each cluster of the computed clustering; and at all areas of the map at which a respective numerical value is provided, applying the coloration assigned to the cluster to which the respective numerical value belongs. Such a method improves the design of a choropleth map.

Abstract: The invention notably relates to a computer-implemented method of clustering reference queries in a database for prediction of the runtime of a target query in the database based on similarity of the target query with the reference queries. The method comprises providing a number of numerical values that represent the runtimes of the reference queries; computing the optimal K-means clustering of the numerical values for a predetermined number of clusters, wherein the computing includes iterating, a number of times corresponding to the predetermined number of clusters, a linear-time Row Minima Searching algorithm applied to a square matrix of order equal to the number of numerical values; and clustering the reference queries according to the computed clustering of the numerical values. Such a method improves the field of database query runtime prediction.