Sciweavers

337 search results - page 22 / 68
» Efficient algorithms for ranking with SVMs
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
WWW
2004
ACM
16 years 6 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
DCC
2005
IEEE
16 years 5 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
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...
Amir Said
WWW
2008
ACM
16 years 6 months ago
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
Guoliang Li, Jianhua Feng, Jianyong Wang, Bei Yu, ...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 6 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran