6365 search results - page 295 / 1273 » Fast Local Computation Algorithms |
139
Voted
IJCAI
1997
15 years 8 months ago
1997
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
205
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
240
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
213
click to vote
COMCOM
2010
15 years 6 months ago
2010
In this paper, we consider QoS aware mesh networks that are maintained by multiple operators and they cooperate in the provision of networking services to the mesh clients. In ord...
209
Voted
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...