429 search results - page 9 / 86 » Solving the Maximum Clique Problem Using PUBB |
SAC
2004
ACM
15 years 3 months ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper introduces a new stochastic surface model for deformable 3D surfaces and demonstrates its utility for the purpose of 3D sculpting. This is the problem of simple-touse a...
TVLSI
2008
14 years 9 months ago
2008
Abstract--In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median comput...
NIPS
2007
14 years 11 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 ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Because of the large number of possible combinations for the fuel assembly loading in the core, the design of the loading pattern (LP) is a complex optimization problem. It requir...