2018 search results - page 151 / 404 » Magnitude-preserving ranking algorithms |
149
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
129
click to vote
IJFCS
2007
15 years 6 months ago
2007
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
150
click to vote
TREC
2001
15 years 7 months ago
2001
We assess a family of ranking mechanisms for search engines based on linkage analysis using a carefully engineered subset of the World Wide Web, WT10g (Bailey, Craswell and Hawking...
180
click to vote
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we propose a domain partitioning RankBoost approach for face recognition. This method uses Local Gabor Binary Pattern Histogram (LGBPH) features for face representat...
251
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...