2570 search results - page 460 / 514 » Fast Algorithms For The Computation Of Ranklets |
EWSN
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Several localization algorithms exist for wireless sensor networks that use angle of arrival measurements to estimate node position. However, there are limited options fo...
ICCAD
2007
IEEE
15 years 6 months ago
2007
IEEE
—As the 193nm lithography is likely to be used for 45nm and even 32nm processes, much more stringent requirement will be posed on Optical Proximity Correction (OPC) technologies....
ICCAD
2007
IEEE
15 years 6 months ago
2007
IEEE
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...
110
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
102
click to vote
SCIA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Solutions to non-linear least squares problems play an essential role in structure and motion problems in computer vision. The predominant approach for solving these prob...