*Research partially supported bv ONR Contract N00014-80-C0741.

be that tuple ranks alone are not enough to reveal the private attribute values, our investigation shows that this is not the case in reality. Specifically, we define a novel problem of rank based inference, and introduce a taxonomy of the problem space according to two dimensions, (1) the type of query

In recent years, there has been much research in the adoption of Ranked Retrieval model (in addition to the Boolean retrieval model) in structured databases, especially those in a client-server environ-ment (e.g., web databases). With this model, a search query re-turns top-k tuples according

in the context of R-estimation. Although they are not strictly affine-equivariant, they are shown to be equivariant in a weak asymptotic sense. Simulations confirm their feasibility and excellent finite-sample performances. 1. Introduction. 1.1. Rank-based inference for elliptical families. An elliptical density

We propose a class of rank-based procedures for testing that the shape matrix V of an elliptical distribution (with unspecified center of symmetry, scale, and radial density) has some fixed value V0; this includes, for V0 = Ik, the problem of testing for sphericity as an important particular case

all be understood in terms of exact or approximate forms of these variational representations. The variational approach provides a complementary alternative to Markov chain Monte Carlo as a general source of approximation methods for inference in large-scale statistical models.

Abstract not found

The use of information retrieval systems in networked environments raises a new set of issues that have received little attention. These issues include ranking document collections for relevance to a query, selecting the best set of collections from a ranked list, and merging the document rankings

with neighboring genes. An additional hyperparameter, inversely related to the number of empirical observations, determines the strength of the background variance. Simulations show that these point estimates, combined with a t-test, provide a systematic inference approach that compares favorably with simple t

orthography without computing depth as an intermediate step. An image stream can be represented by the 2FxP measurement matrix of the image coordinates of P points tracked through F frames. We show that under orthographic projection this matrix is of rank 3. Based on this observation, the factorization method