57 search results - page 2 / 12 » A new approach to the planted clique problem |
SIAMJO
2002
13 years 5 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
LION
2009
Springer
14 years 14 days ago
2009
Springer
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
COMAD
2009
13 years 7 months ago
2009
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
EOR
2008
13 years 5 months ago
2008
This paper presents a new approach to quality control of wastewater treatment. The first part formulates basic principles of statistical process control (SPC) and Taguchi Method. ...
IPPS
2008
IEEE
14 years 10 days ago
2008
IEEE
We present a junction tree decomposition based algorithm for parallel exact inference. This is a novel parallel exact inference method for evidence propagation in an arbitrary jun...