2745 search results - page 81 / 549 » A fast algorithm for computing large Fibonacci numbers |
122
Voted
GD
2005
Springer
15 years 9 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
255
Voted
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical pa...
116
Voted
TCOM
2010
14 years 10 months ago
2010
Abstract--For a multiple-input multiple-output (MIMO) system with more antennas at the receiver than the transmitter, selecting the same number of receiver antennas as the number o...
107
Voted
MSE
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we present fast algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Nobel Successive Elimination Algorithms fo...
154
Voted
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
The Internet contains billions of images, freely available online. Methods for efficiently searching this incredibly rich resource are vital for a large number of applications. Th...