299 search results - page 35 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
DAGM
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In this paper, we propose a variational framework for computing a superresolved image of a scene from an arbitrary input video. To this end, we employ a recently proposed...
105
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Last years have witnessed how crowd simulations have become an essential tool for many virtual environment applications. These applications require both rendering visually plausib...
ICCAD
2003
IEEE
15 years 6 months ago
2003
IEEE
Routing for FPGAs has been a very challenging problem due to the limitation of routing resources. Although the FPGA routing problem has been researched extensively, most algorithm...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...