Sciweavers

696 search results - page 138 / 140
» Prioritising Preference Relations
Sort
View
CIKM
2010
Springer
13 years 6 months ago
FacetCube: a framework of incorporating prior knowledge into non-negative tensor factorization
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
Yun Chi, Shenghuo Zhu
PAMI
2010
103views more  PAMI 2010»
13 years 5 months ago
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
Amin Mantrach, Luh Yen, Jérôme Callut...
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 5 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
WEBI
2010
Springer
13 years 5 months ago
How to Improve Your Google Ranking: Myths and Reality
Abstract--Search engines have greatly influenced the way people access information on the Internet as such engines provide the preferred entry point to billions of pages on the Web...
Ao-Jan Su, Y. Charlie Hu, Aleksandar Kuzmanovic, C...
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 5 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen