11862 search results - page 52 / 2373 » Relative information completeness |
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
In previous papers [SC05, SBC+07], some of us predicted the end of "one size fits all" as a commercial relational DBMS paradigm. These papers presented reasons and exper...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
We consider experiments to measure the quality of a web search algorithm based on how much total time users take to complete assigned search tasks using that algorithm. We first ...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
In bibliographies like DBLP and Citeseer, there are three kinds of entity-name problems that need to be solved. First, multiple entities share one name, which is called the name sh...
TIT
2010
13 years 2 months ago
2010
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
UAI
2003
13 years 9 months ago
2003
We show how to use linear belief functions to represent market information and financial knowledge, including complete ignorance, statistical observations, subjective speculations...