We report on several experiments in using data fusion to improve information retrieval, and in approximate text and 5-gram mathcing methods for retrieval of corrupted text, in the TREC context.

In this paper, we consider (random) sampling of signals concentrated on a bounded Corkscrew domain ? metric measure space, and reconstructing approximately from their (un)corrupted data taken set contained in ?. We establish weighted stability bi-Lipschitz type for scheme the reproducing kernel space. The provides weak robustness to scheme, however due nonconvexity signals, it does not imply un...

The goal of Multi-Party Computation (MPC) is to perform an arbitrary computation in a distributed, private, and fault-tolerant way. For this purpose, a fixed set of n parties runs a protocol that tolerates an adversary corrupting a subset of the participating parties, and still preserves certain security guarantees. Most MPC protocols provide security guarantees in an all-or-nothing fashion: Ei...

A broadcast protocol allows a sender to distribute a value among a set of players such that it is guaranteed that all players receive the same value (consistency), and if the sender is honest, then all players receive the sender’s value (validity). Classical broadcast protocols for n players provide security with respect to a fixed threshold t < n/3, where both consistency and validity are guar...

In this paper we consider high dimensional sparse regression, and develop strategies able to deal with arbitrary – possibly, severe or coordinated – errors in the covariance matrix X . These may come from corrupted data, persistent experimental errors, or malicious respondents in surveys/recommender systems, etc. Such non-stochastic error-invariables problems are notoriously difficult to treat,...

This letter considers the problem of multi-agent distributed linear regression in presence system noises. In this problem, comprises multiple agents wherein each agent locally observes a set data points, and agents' goal is to compute model that best fits collective points observed by all agents. We consider server-based architecture where interact with common server solve problem; however, can...

in this paper, a new algorithm for system identification based on frequency response is presented. in this method, given a set of magnitudes and phases of the system transfer function in a set of discrete frequencies, a system of linear equations is derived which has a unique and exact solution for the coefficients of the transfer function provided that the data is noise-free and the degrees of...

Broadcast, also called Byzantine Agreement, is a multi-party computation primitive where a dealer sends his input value to a group of players. All players must agree on the same output value, even if a part of these players is corrupted by an adversary. Furthermore, when the dealer is not corrupted, the output value of the correct players must be the input value of the dealer. It has been prove...