9176 search results - page 1737 / 1836 » algorithms 2010 |
141
click to vote
WWW
2010
ACM
15 years 11 months ago
2010
ACM
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
148
Voted
WWW
2010
ACM
15 years 11 months ago
2010
ACM
User experience in social media involves rich interactions with the media content and other participants in the community. In order to support such communities, it is important to...
140
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
150
Voted
STACS
2010
Springer
15 years 11 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
145
Voted
WWW
2010
ACM
15 years 11 months ago
2010
ACM
In online content voting networks, aggregate user activities (e.g., submitting and rating content) make high-quality content thrive through the unprecedented scale, high dynamics ...