204 search results - page 33 / 41 » Testing Triangle-Freeness in General Graphs |
NIPS
2007
13 years 9 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
SIAMJO
2002
13 years 7 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 ...
SIGSOFT
2010
ACM
13 years 2 months ago
2010
ACM
Although a number of automatic tools have been developed to detect faults, much of the diagnosis is still being done manually. To help with the diagnostic tasks, we formally intro...
TIT
2008
13 years 7 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...