2137 search results - page 375 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
127
click to vote
WWW
2007
ACM
16 years 3 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
134
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
138
click to vote
SPAA
1993
ACM
15 years 6 months ago
1993
ACM
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
135
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Coalition structure generation (CSG) for multi-agent systems is a well-studied problem. A vast majority of the previous work and the state-of-the-art approaches to CSG assume a ch...
113
click to vote
ALT
2008
Springer
15 years 11 months ago
2008
Springer
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...