Sciweavers

512 search results - page 13 / 103
» Ranking interesting subgroups
Sort
View
DATE
2006
IEEE
127views Hardware» more  DATE 2006»
14 years 1 months ago
Software implementation of Tate pairing over GF(2m)
Recently, the interest about the Tate pairing over binary fields has decreased due to the existence of efficient attacks to the discrete logarithm problem in the subgroups of su...
Guido Bertoni, Luca Breveglieri, Pasqualina Fragne...
SIGMOBILE
2008
86views more  SIGMOBILE 2008»
13 years 7 months ago
Profile-cast: behavior-aware mobile networking
In this paper we advocate a service paradigm, profile-cast, within the communication framework of delay tolerant networks (DTN)[2]. This novel approach leverages the behavioral pat...
Wei-jen Hsu, Debojyoti Dutta, Ahmed Helmy
NIPS
2004
13 years 8 months ago
Learning Preferences for Multiclass Problems
Many interesting multiclass problems can be cast in the general framework of label ranking defined on a given set of classes. The evaluation for such a ranking is generally given ...
Fabio Aiolli, Alessandro Sperduti
ISCI
2011
13 years 2 months ago
Rational Research model for ranking semantic entities
—Ranking plays important roles in contemporary Internet and vertical search engines. Among existing ranking algorithms, link analysis based algorithms have been proved as effecti...
Wang Wei, Payam M. Barnaghi, Andrzej Bargiela
AAAI
2006
13 years 8 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...