1046 search results - page 31 / 210 » Approximation Algorithms for Domination Search |
72
Voted
SAC
2008
ACM
14 years 12 months ago
2008
ACM
This paper proposes a way to enable approximate queries in a peer-to-peer network by using a special encoding function and error correcting codes. The encoding function maintains ...
100
Voted
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
107
Voted
MM
2003
ACM
15 years 5 months ago
2003
ACM
Effective use of multimedia collections requires efficient and intuitive methods of searching and browsing. This work considers databases which store music and explores how these...
95
Voted
EUROPAR
2007
Springer
15 years 6 months ago
2007
Springer
The dominant eigenvector of matrices defined by weighted links in overlay networks plays an important role in many peer-to-peer applications. Examples include trust management, im...
104
Voted
SODA
2008
ACM
15 years 1 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...