2033 search results - page 322 / 407 » Ranking on Data Manifolds |
144
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Large collections of documents are commonly created around a database, where a typical database schema may contain hundreds of tables and thousands of columns. We developed a syst...
DCC
2005
IEEE
15 years 9 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
WSDM
2010
ACM
15 years 7 months ago
2010
ACM
We describe a machine learning approach for predicting sponsored search ad relevance. Our baseline model incorporates basic features of text overlap and we then extend the model t...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
MATES
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Searching for information in large rather unstructured realworld data sets is a di cult task, because the user expects immediate responses as well as high-quality search ...