2745 search results - page 94 / 549 » A fast algorithm for computing large Fibonacci numbers |
144
click to vote
CVPR
2000
IEEE
16 years 5 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
135
click to vote
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
129
click to vote
SIGCOMM
1998
ACM
15 years 7 months ago
1998
ACM
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header elds of the packet such as source address,...
131
Voted
STOC
1999
ACM
15 years 8 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
122
Voted
GLVLSI
2003
IEEE
15 years 9 months ago
2003
IEEE
Modeling on-chip inductive effects for interconnects of multigigahertz microprocessors remains challenging. SPICE simulation of these effects is very slow because of the large num...