501 search results - page 94 / 101 » Rough Sets |
SIGECOM
2010
ACM
14 years 14 days ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
WDAG
2009
Springer
14 years 5 days ago
2009
Springer
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
ICMCS
1999
IEEE
13 years 12 months ago
1999
IEEE
Hidden copyright marks have been proposed as a solution for solving the illegal copying and proof of ownership problems in the context of multimedia objects. Many systems have been...
CHES
2006
Springer
13 years 11 months ago
2006
Springer
Side-channel attacks are a serious threat to implementations of cryptographic algorithms. Secret information is recovered based on power consumption, electromagnetic emanations or ...
ATVA
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...