7 search results - page 2 / 2 » Can General Relativistic Computers Break the Turing Barrier |
PAMI
2011
12 years 8 months ago
2011
—Affine registration has a long and venerable history in computer vision literature, and in particular, extensive work has been done for affine registration in IR2 and IR3 . This...
JACM
2000
13 years 5 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...