429 search results - page 46 / 86 » Solving the Maximum Clique Problem Using PUBB |
WCNC
2010
IEEE
13 years 11 months ago
2010
IEEE
—Recently, we proposed a frequency-domain block signal detection using maximum likelihood detection (MLD) employing QR decomposition and M-algorithm (QRM-MLD) for the cyclic pref...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
ACMSE
2008
ACM
13 years 9 months ago
2008
ACM
With stock surpluses and shortages representing one of the greatest elements of risk to wholesalers, a solution to the multiretailer supply chain management problem would result i...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...