1461 search results - page 281 / 293 » Complexity of Graph Covering Problems |
118
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
136
click to vote
AAAI
2010
15 years 2 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
111
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
132
click to vote
IPSN
2011
Springer
14 years 4 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
128
click to vote
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...