Sciweavers

Share
283 search results - page 1 / 57
» New Dynamic SPT Algorithm Based on a Ball-and-String Model
Sort
View
INFOCOM
1999
IEEE
10 years 1 months ago
New Dynamic SPT Algorithm Based on a Ball-and-String Model
A key functionality in today's widely used interior gateway routing protocols such as OSPF and IS
Paolo Narváez, Kai-Yeung Siu, Hong-Yi Tzeng
ISCAPDCS
2003
9 years 10 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
VR
2003
IEEE
267views Virtual Reality» more  VR 2003»
10 years 2 months ago
An Experiment Comparing Double Exponential Smoothing and Kalman Filter-Based Predictive Tracking Algorithms
We present an experiment comparing double exponential smoothing and Kalman filter-based predictive tracking algorithms with derivative free measurement models. Our results show t...
Joseph J. LaViola Jr.
CVPR
2011
IEEE
9 years 1 months ago
Robust Tracking Using Local Sparse Appearance Model and K-Selection
Online learned tracking is widely used for it’s adaptive ability to handle appearance changes. However, it introduces potential drifting problems due to the accumulation of erro...
Baiyang Liu, junzhou Huang, Casimir Kulikowski, Li...
SAT
2010
Springer
158views Hardware» more  SAT 2010»
10 years 1 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
books