Results 1 - 10
of
69,875
Exact Matrix Completion via Convex Optimization
, 2008
"... We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfe ..."
Abstract
-
Cited by 873 (26 self)
- Add to MetaCart
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can
Modern Information Retrieval
, 1999
"... Information retrieval (IR) has changed considerably in the last years with the expansion of the Web (World Wide Web) and the advent of modern and inexpensive graphical user interfaces and mass storage devices. As a result, traditional IR textbooks have become quite out-of-date which has led to the i ..."
Abstract
-
Cited by 3233 (29 self)
- Add to MetaCart
Information retrieval (IR) has changed considerably in the last years with the expansion of the Web (World Wide Web) and the advent of modern and inexpensive graphical user interfaces and mass storage devices. As a result, traditional IR textbooks have become quite out-of-date which has led
FRIENDLY EQUILIBRIUM POINTS IN EXTENSIVE GAMES WITH COMPLETE INFORMATION By
, 2008
"... with complete information by ..."
Using Linear Algebra for Intelligent Information Retrieval
- SIAM REVIEW
, 1995
"... Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical ..."
Abstract
-
Cited by 676 (18 self)
- Add to MetaCart
by 200-300 of the largest singular vectors are then matched against user queries. We call this retrieval method Latent Semantic Indexing (LSI) because the subspace represents important associative relationships between terms and documents that are not evident in individual documents. LSI is a completely
Multimodality Image Registration by Maximization of Mutual Information
- IEEE TRANSACTIONS ON MEDICAL IMAGING
, 1997
"... A new approach to the problem of multimodality medical image registration is proposed, using a basic concept from information theory, mutual information (MI), or relative entropy, as a new matching criterion. The method presented in this paper applies MI to measure the statistical dependence or in ..."
Abstract
-
Cited by 791 (10 self)
- Add to MetaCart
A new approach to the problem of multimodality medical image registration is proposed, using a basic concept from information theory, mutual information (MI), or relative entropy, as a new matching criterion. The method presented in this paper applies MI to measure the statistical dependence
A General Theory of Equilibrium Selection in Games.
, 1988
"... Abstract This paper presents a Downsian model of political competition in which parties have incomplete but richer information than voters on policy effects. Each party can observe a private signal of the policy effects, while voters cannot. In this setting, voters infer the policy effects from the ..."
Abstract
-
Cited by 734 (4 self)
- Add to MetaCart
of the Median Voter Theorem in the classical Downsian model. Our equilibrium analysis suggests similarity between the set of WPBEs in this model and the set of uniformly perfect equilibria of Harsanyi and Selten (1988) in the model with completely informed parties which we studied in a previous paper
Implementation with Near-Complete Information
, 2001
"... Many refinements of Nash equilibrium yield solution correspondences which do not have closed graph in the space of payoffs or information. This has significance for implementation theory, especially under complete information. If a planner is concerned that all equilibria of his mechanism yield a de ..."
Abstract
-
Cited by 14 (1 self)
- Add to MetaCart
Many refinements of Nash equilibrium yield solution correspondences which do not have closed graph in the space of payoffs or information. This has significance for implementation theory, especially under complete information. If a planner is concerned that all equilibria of his mechanism yield a
Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web
- IN PROC. 29TH ACM SYMPOSIUM ON THEORY OF COMPUTING (STOC
, 1997
"... We describe a family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such as the Internet, where delays caused by hot spots can be severe, and ..."
Abstract
-
Cited by 699 (10 self)
- Add to MetaCart
, and where it is not feasible for every server to have complete information about the current state of the entire network. The protocols are easy to implement using existing network protocols such as TCP/IP, and require very little overhead. The protocols work with local control, make efficient use
The KEGG resource for deciphering the genome
- Nucleic Acids Res
, 2004
"... A grand challenge in the post-genomic era is a complete computer representation of the cell and the organism, which will enable computational prediction of higher-level complexity of cellular processes and organism behavior from genomic information. Toward this end we have been developing a knowledg ..."
Abstract
-
Cited by 513 (24 self)
- Add to MetaCart
A grand challenge in the post-genomic era is a complete computer representation of the cell and the organism, which will enable computational prediction of higher-level complexity of cellular processes and organism behavior from genomic information. Toward this end we have been developing a
The Lumigraph
- IN PROCEEDINGS OF SIGGRAPH 96
, 1996
"... This paper discusses a new method for capturing the complete appearanceof both synthetic and real world objects and scenes, representing this information, and then using this representation to render images of the object from new camera positions. Unlike the shape capture process traditionally used ..."
Abstract
-
Cited by 1025 (39 self)
- Add to MetaCart
This paper discusses a new method for capturing the complete appearanceof both synthetic and real world objects and scenes, representing this information, and then using this representation to render images of the object from new camera positions. Unlike the shape capture process traditionally used
Results 1 - 10
of
69,875