1804 search results - page 276 / 361 » Ranking for data repairs |
128
click to vote
DCC
2005
IEEE
16 years 4 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...
124
click to vote
WSDM
2010
ACM
16 years 1 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...
155
click to vote
SODA
2010
ACM
16 years 1 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 ...
132
click to vote
MATES
2009
Springer
15 years 11 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 ...
123
click to vote
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...