Sciweavers

143 search results - page 16 / 29
» How to rank with few errors
Sort
View
NIPS
2007
15 years 1 months ago
Probabilistic Matrix Factorization
Many existing approaches to collaborative filtering can neither handle very large datasets nor easily deal with users who have very few ratings. In this paper we present the Prob...
Ruslan Salakhutdinov, Andriy Mnih
DEBU
2010
139views more  DEBU 2010»
14 years 9 months ago
Refining Information Extraction Rules using Data Provenance
Developing high-quality information extraction (IE) rules, or extractors, is an iterative and primarily manual process, extremely time consuming, and error prone. In each iteratio...
Bin Liu 0002, Laura Chiticariu, Vivian Chu, H. V. ...
ICML
2008
IEEE
16 years 15 days ago
Fast solvers and efficient implementations for distance metric learning
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
Kilian Q. Weinberger, Lawrence K. Saul
CHI
2003
ACM
16 years 1 days ago
Reflowing digital ink annotations
Annotating paper documents with a pen is a familiar and indispensable activity across a wide variety of work and educational settings. Recent developments in pen-based computing p...
David Bargeron, Tomer Moscovich
AUTOMATICA
2002
126views more  AUTOMATICA 2002»
14 years 11 months ago
Halo orbit mission correction maneuvers using optimal control
This paper addresses the computation of the required trajectory correction maneuvers (TCM) for a halo orbit space mission to compensate for the launch velocity errors introduced b...
Radu Serban, Wang Sang Koon, Martin W. Lo, Jerrold...