Patents by Inventor Katharina Anna Zweig

Katharina Anna Zweig has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Automated determination of networks motifs
    Patent number: 10694345
    Abstract: The present invention relates to a computer-implemented method and a system for determining co-occurrences in at least one graph with n vertices and E edges, wherein each edge is defined by a pair of vertices, the method comprising: storing a binary adjacency matrix representing a first graph in a memory; performing a calculation step for the first graph, wherein the calculation step comprises: loading a block of at most K consecutive rows of the binary adjacency matrix from the memory and storing each row into one of K caches; streaming each of the subsequent uncached rows of the binary adjacency matrix from the memory; reading pairs of rows comprising a streamed row and each one of the cached rows; computing the logical conjunction between each couple of elements of the rows at the same position in the rows for each read pair of rows; and adding the results of the logical conjunction for all the couples of elements in each read pair by means of one-bit adders to obtain the co-occurrence, wherein the calcula
    Type: Grant
    Filed: May 18, 2016
    Date of Patent: June 23, 2020
    Assignee: Technische Universität Kaiserslautern
    Inventors: Katharina Anna Zweig, Christian Brugger, Valentin Grigorovici, Christian De Schryver, Norbert Wehn
  • AUTOMATED DETERMINATION OF NETWORK MOTIFS
    Publication number: 20180160281
    Abstract: The present invention relates to a computer-implemented method and a system for determining co-occurrences in at least one graph with n vertices and E edges, wherein each edge is defined by a pair of vertices, the method comprising: storing a binary adjacency matrix representing a first graph in a memory; performing a calculation step for the first graph, wherein the calculation step comprises: loading a block of at most K consecutive rows of the binary adjacency matrix from the memory and storing each row into one of K caches; streaming each of the subsequent uncached rows of the binary adjacency matrix from the memory; reading pairs of rows comprising a streamed row and each one of the cached rows; computing the logical conjunction between each couple of elements of the rows at the same position in the rows for each read pair of rows; and adding the results of the logical conjunction for all the couples of elements in each read pair by means of one-bit adders to obtain the co-occurrence, wherein the calcula
    Type: Application
    Filed: May 18, 2016
    Publication date: June 7, 2018
    Applicant: Technische Universität Kaiserslautern
    Inventors: Katharina Anna Zweig, Christian Brugger, Valentin Grigorovici, Christian De Schryver, Norbert Wehn