2814 search results - page 472 / 563 » Competitive Analysis of Distributed Algorithms |
WPES
2003
ACM
15 years 6 months ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
105
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
114
Voted
IWQOS
2001
Springer
15 years 5 months ago
2001
Springer
— Efficient network provisioning mechanisms that support service differentiation and automatic capacity dimensioning are essential to the realization of the Differentiated Servi...
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
The representation used by a learning algorithm introduces a bias which is more or less well-suited to any given learning problem. It is well known that, across all possible probl...
109
Voted
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...