604 search results - page 40 / 121 » On the Complexity of the Maximum Cut Problem |
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
91
Voted
JSAC
2011
14 years 4 months ago
2011
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
TSP
2010
14 years 4 months ago
2010
Consider the problem of estimating the parameters of multiple polynomial phase signals observed by a sensor array. In practice, it is difficult to maintain a precisely calibrated a...
117
click to vote
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
ICIP
1998
IEEE
15 years 11 months ago
1998
IEEE
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...