299 search results - page 18 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—We consider the problem of jointly optimizing channel pairing, channel-user assignment, and power allocation in a single-relay multiple-access system. The optimization o...
DAC
2009
ACM
14 years 8 months ago
2009
ACM
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
DAGM
2003
Springer
14 years 24 days ago
2003
Springer
We present an approach to parallel variational optical flow computation by using an arbitrary partition of the image plane and iteratively solving related local variational proble...
ORL
1998
13 years 7 months ago
1998
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
ICCV
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...