Sciweavers

4302 search results - page 733 / 861
» Index Pairs Algorithms
Sort
View
PR
2002
81views more  PR 2002»
13 years 8 months ago
Generalised correlation for multi-feature correspondence
Computing correspondences between pairs of images is fundamental to all structures from motion algorithms. Correlation is a popular method to estimate similarity between patches o...
C. V. Jawahar, P. J. Narayanan
TELSYS
2002
73views more  TELSYS 2002»
13 years 8 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
MJ
2007
87views more  MJ 2007»
13 years 8 months ago
Using SAT-based techniques in power estimation
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
Assim Sagahyroon, Fadi A. Aloul
NETWORKS
2007
13 years 8 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei
FS
2010
105views more  FS 2010»
13 years 7 months ago
Local time and the pricing of time-dependent barrier options
Abstract A time-dependent double-barrier option is a derivative security that delivers the terminal value φ(ST ) at expiry T if neither of the continuous time-dependent barriers b...
Aleksandar Mijatovic