2745 search results - page 416 / 549 » A fast algorithm for computing large Fibonacci numbers |
138
click to vote
CVPR
1998
IEEE
16 years 6 months ago
1998
IEEE
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
147
click to vote
DCC
2002
IEEE
16 years 4 months ago
2002
IEEE
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
149
click to vote
HPCA
2006
IEEE
16 years 5 months ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
164
Voted
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
164
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...