3049 search results - page 517 / 610 » On the Convergence of Bound Optimization Algorithms |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarante...
ASPDAC
2006
ACM
14 years 2 months ago
2006
ACM
—Designing high-performance systems with high yield under parameter variations has raised serious design challenges in nanometer technologies. In this paper, we propose a profit-...