3049 search results - page 517 / 610 » On the Convergence of Bound Optimization Algorithms |
167
click to vote
CORR
2010
Springer
14 years 11 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...
118
click to vote
STOC
2001
ACM
16 years 4 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 ...
131
Voted
CVPR
2010
IEEE
16 years 12 days 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...
121
click to vote
ICALP
2007
Springer
15 years 10 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...
122
click to vote
ASPDAC
2006
ACM
15 years 10 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-...