2745 search results - page 111 / 549 » A fast algorithm for computing large Fibonacci numbers |
133
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
159
click to vote
IAT
2006
IEEE
16 years 11 days ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
119
click to vote
GREC
2007
Springer
16 years 14 days ago
2007
Springer
This paper deals with the CBIR of old printed graphics (of XVI◦ and XVII◦ centuries) like the headpieces, the pictures and the ornamental letters. These graphical parts are pre...
185
click to vote
ICNP
1997
IEEE
15 years 10 months ago
1997
IEEE
TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows than p...
157
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...