Sciweavers

14704 search results - page 219 / 2941
» computing 2007
Sort
View
131
Voted
MVA
1996
129views Computer Vision» more  MVA 1996»
15 years 4 months ago
Computation of Optical Flow Using Dynamic Programming
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
Georges Quénot
106
Voted
NIPS
1996
15 years 4 months ago
Are Hopfield Networks Faster than Conventional Computers?
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
Ian Parberry, Hung-Li Tseng
118
Voted
MVA
1992
15 years 4 months ago
Contour Map Reconstruction via Multi-Module Parallel Computational Scheme
Module-1 :Computation of gradient directions. Reconstruction of a set of imperfect contour curves which is extracted :Assignment of discreteheight to contourcurves. from a topograp...
Miyuki Kawashima, Ryuji Tokunaga, Yuzo Hirai
AUTOMATICA
2006
88views more  AUTOMATICA 2006»
15 years 3 months ago
Exact computation of amplification for a class of nonlinear systems arising from cellular signaling pathways
A commonly employed measure of the signal amplification properties of an input/output system is its induced L2 norm, sometimes also known as H gain. In general, however, it is ext...
Eduardo D. Sontag, Madalena Chaves
136
Voted
COMPLEXITY
2007
104views more  COMPLEXITY 2007»
15 years 3 months ago
What is the complexity of a distributed computing system?
Distributed computing systems are becoming bigger and more complex. While the complexity of large-scale distributed systems has been acknowledged to be an important challenge, the...
Anand Ranganathan, Roy H. Campbell