Hampp-Bahnmueller
Thomas Hampp-Bahnmueller, Stuttgart GE
Patent application number | Description | Published |
---|---|---|
20150263984 | COMMUNICATION METHOD AND SYSTEM FOR ACCESSING MEDIA DATA - Providing access to media data shared by multiple users. A predefined edge weight is assigned to each edge of a linked data structure based on a dependency category of the edge. A first access rating value is assigned to each node. A rating residue value is calculated as the difference between the two first access rating values of the nodes connected by each edge. The data structure is traversed from a seed node, and for each edge traversed, calculating a second access rating value using an edge weight value and the first access rating value. Repeating until the rating residue values meet a predefined convergence criterion. The nodes having access rating values meeting a predefined data removal criterion are selected from the nodes of the linked data structure. The data entities corresponding to the selected nodes are then removed. | 09-17-2015 |
Thomas Hampp-Bahnmueller, Stuttgart DE
Patent application number | Description | Published |
---|---|---|
20100174713 | Enhanced Content Web Browsing - An embodiment of a method for enhanced content browsing includes loading a web page in a user interface; detecting entities of a first specified type in the web page by an analysis service; tagging the detected entities in the web page; calling an action service associated with the analysis service when a detected entity is activated; and displaying a result of the action service in the user interface. Embodiments of systems for enhanced content browsing are also provided. | 07-08-2010 |
Thomas Hampp-Bahnmueller, Stuttgart-Vaihingen DE
Patent application number | Description | Published |
---|---|---|
20120150867 | CLUSTERING A COLLECTION USING AN INVERTED INDEX OF FEATURES - Provided are techniques for creating an inverted index for features of a set of data elements, wherein each of the data elements is represented by a vector of features, wherein the inverted index, when queried with a feature, outputs one or more data elements containing the feature. The features of the set of data elements are ranked. For each feature in the ranked list, the inverted index is queried for data elements having the feature and not having any previously selected feature and a cluster of the data elements is created based on results returned in response to the query. | 06-14-2012 |
Thomas Hampp-Bahnmueller, Boeblingen DE
Patent application number | Description | Published |
---|---|---|
20100306307 | SYSTEM AND METHOD FOR SOCIAL BOOKMARKING/TAGGING AT A SUB-DOCUMENT AND CONCEPT LEVEL - According to one embodiment of the present invention, a method for social bookmarking and tagging documents is provided. According to one embodiment of the present invention, a method comprises receiving a new document in a tagging server having a storage unit with stored tags associated with a preexisting document and comparing the new document with the tags using a processor to find matching instances between parts of the new document and the tags. Each matching instance in the new document is marked with tag information. The marked up new document is delivered for display on a display unit. | 12-02-2010 |
Thomas A. Hampp-Bahnmueller, Stuttgart DE
Patent application number | Description | Published |
---|---|---|
20150154253 | Method and System for Performing Search Queries Using and Building a Block-Level Index - A method and a computer-readable medium for method for searching a plurality of documents. Each document is structured into a set of blocks and each block is associated with a block ID. The method includes receiving a search query including a search term having at least one search term attribute; identifying at least one block ID based on a correlation between the at least one search term attribute and the set of blocks; and identifying at least one document based on a correlation between the set of blocks and the documents. Methods for generating a data structure for searching documents are also described. | 06-04-2015 |
Thomas A. P. Hampp-Bahnmueller, Stuttgart-Vaihingen DE
Patent application number | Description | Published |
---|---|---|
20150178344 | VERIFICATION OF TRANSFORMED CONTENT - A computer manages methods for determining accurate document transformation by rendering the source document into a non-rasterized format, where the non-rasterized format is a rendered source document. The computer rendering the target document into a non-rasterized format, where the non-rasterized format is a rendered target document. The computer comparing one or more aspects of the rendered source document to corresponding one or more aspects of the rendered target document. The computer determining, based, at least in part, on the compared one or more aspects, whether or not the source document was accurately transformed to the target document. | 06-25-2015 |
20150178358 | VERIFICATION OF TRANSFORMED CONTENT - A computer manages methods for determining accurate document transformation by rendering the source document into a non-rasterized format, where the non-rasterized format is a rendered source document. The computer rendering the target document into a non-rasterized format, where the non-rasterized format is a rendered target document. The computer comparing one or more aspects of the rendered source document to corresponding one or more aspects of the rendered target document. The computer determining, based, at least in part, on the compared one or more aspects, whether or not the source document was accurately transformed to the target document. | 06-25-2015 |
Thomas A. P. Hampp-Bahnmueller, Stuttgart DE
Patent application number | Description | Published |
---|---|---|
20150278261 | TERM CONSOLIDATION FOR INDICES - A computer-implemented method, carried out by one or more processors, for consolidating an index entry of a dictionary. In an embodiment, the method comprises the steps of receiving, by one or more processors, a set of parameters, wherein the set of parameters indicates at least a length of prefix and a length of hash value; receiving, by one or more processors, a first term for entry into an index; converting, by one or more processors, the first term for entry into the index according to the set of parameters; and responsive to determining the converted first term is not present in the index, storing, by one or more processors, the first converted term into the index. | 10-01-2015 |
20150278265 | TERM CONSOLIDATION FOR INDICES - A computer-implemented method, carried out by one or more processors, for consolidating an index entry of a dictionary. In an embodiment, the method comprises the steps of receiving, by one or more processors, a set of parameters, wherein the set of parameters indicates at least a length of prefix and a length of hash value; receiving, by one or more processors, a first term for entry into an index; converting, by one or more processors, the first term for entry into the index according to the set of parameters; and responsive to determining the converted first term is not present in the index, storing, by one or more processors, the first converted term into the index. | 10-01-2015 |