Haeupler
Bernhard Haeupler, Boston, MA US
Patent application number | Description | Published |
---|---|---|
20140064296 | Method And Apparatus For Performing Finite Memory Network Coding In An Arbitrary Network - Techniques for performing finite memory network coding in an arbitrary network limit an amount of memory that is provided within a node of the network for the performance of network coding operations during data relay operations. When a new data packet is received by a node, the data stored within the limited amount of memory may be updated by linearly combining the new packet with the stored data. In some implementations, different storage buffers may be provided within a node for the performance of network coding operations and decoding operations. | 03-06-2014 |
20160006676 | Method And Apparatus For Performing Finite Memory Network Coding In An Arbitrary Network - Techniques for performing finite memory network coding in an arbitrary network limit an amount of memory that is provided within a node of the network for the performance of network coding operations during data relay operations. When a new data packet is received by a node, the data stored within the limited amount of memory may be updated by linearly combining the new packet with the stored data. In some implementations, different storage buffers may be provided within a node for the performance of network coding operations and decoding operations. | 01-07-2016 |
Bernhard Haeupler, Mountain View, CA US
Patent application number | Description | Published |
---|---|---|
20150310102 | GENERATING UNWEIGHTED SAMPLES FROM WEIGHTED FEATURES - Weighted features associated with a document are scaled using scales to generate a set of unweighted elements for each scale. A sketch is generated for each scale by sampling the unweighted elements generated for the scale. The scales are chosen based on a selected cutoff factor so that documents that have a similarity that is less than the cutoff factor might have no scales in common, while documents that have a similarity that is greater than the cutoff factor will have at sufficiently many but at least one scale in common. The similarity of these documents can be estimated using the sketches associated with each of the documents for the common scales. | 10-29-2015 |
20160028679 | ERROR CORRECTION FOR INTERACTIVE MESSAGE EXCHANGES USING SUMMARIES - In a conversation between a first computing device and a second computing device over a communication channel, each computing device keeps a transcript of the messages that have been sent and received by that computing device. After a threshold number of messages have been sent and received by the devices, each device transmits a summary of the messages sent and received by that device to the other device. If the summaries match, then the messages were sent and received successfully by each device, and the devices can continue to exchange messages until the threshold number of messages is reached again. If the summaries do not match, the devices can roll-back a part of the conversation and the transcript and continue covered by the summaries and continue from there. | 01-28-2016 |
Bernhard Haeupler, Pittsburgh, PA US
Patent application number | Description | Published |
---|---|---|
20160105323 | NODE IDENTIFICATION USING CLUSTERS - During an initialization phase, some nodes of a network form clusters. The nodes in a cluster share information with a leader node, which knows all of the nodes that each of the nodes in the cluster is aware of. During a growth phase, clusters are randomly activated or deactivated. The nodes of the activated clusters message randomly selected known nodes, asking the nodes to merge with the cluster. The nodes of deactivated clusters determine which activated cluster to join based on received messages. After the growth phase ends, the remaining clusters may merge to form a single cluster, and the list of nodes known to the leader of the single cluster may be shared as the list of all nodes on the network. | 04-14-2016 |
Wolfgang Haeupler, Rosenheim DE
Patent application number | Description | Published |
---|---|---|
20150303543 | RADIO-FREQUENCY BLOCKING FILTER - A radio-frequency filter comprises an input terminal and an output terminal. A signal line is galvanically connected or capacitively coupled firstly to the input terminal and secondly to the output terminal. The signal line, with the formation of a capacitive inner conductor and/or resonator coupling, runs past the relevant inner conductor through the resonators of the radio-frequency blocking filter. The signal line has at least one galvanic isolation location in the form of a capacitive isolation location. The capacitive isolation location is spaced apart from the inner conductors and capacitively coupled thereto. The resonators and/or the inner conductors capacitively coupled to the signal line. | 10-22-2015 |