2745 search results - page 113 / 549 » A fast algorithm for computing large Fibonacci numbers |
116
Voted
TIT
1998
15 years 3 months ago
1998
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
143
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
212
Voted
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
One source of difficulties when processing outdoor images is the presence of haze, fog or smoke which
fades the colors and reduces the contrast of the observed objects. We introdu...
139
Voted
PAMI
2010
15 years 2 months ago
2010
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
130
Voted
ICCAD
2008
IEEE
16 years 18 days ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...