Sciweavers

72 search results - page 5 / 15
» An algorithm for ranking assignments using reoptimization
Sort
View
99
Voted
ITA
2006
163views Communications» more  ITA 2006»
14 years 11 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
ICTAI
2006
IEEE
15 years 5 months ago
Improve Decision Trees for Probability-Based Ranking by Lazy Learners
Existing work shows that classic decision trees have inherent deficiencies in obtaining a good probability-based ranking (e.g. AUC). This paper aims to improve the ranking perfor...
Han Liang, Yuhong Yan
91
Voted
SPEECH
1998
171views more  SPEECH 1998»
14 years 11 months ago
Heteroscedastic discriminant analysis and reduced rank HMMs for improved speech recognition
We present the theory for heteroscedastic discriminant analysis (HDA), a model-based generalization of linear discriminant analysis (LDA) derived in the maximum-likelihood framewo...
Nagendra Kumar, Andreas G. Andreou
RIVF
2003
15 years 1 months ago
Airspace Sectorization By Constraint Programming
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
Huy Trandac, Philippe Baptiste, Vu Duong
CIKM
2004
Springer
15 years 5 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel