Sciweavers

659 search results - page 77 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
JSS
2007
121views more  JSS 2007»
13 years 7 months ago
Opportunistic prioritised clustering framework for improving OODBMS performance
In object oriented database management systems, clustering has proven to be one of the most effective performance enhancement techniques. Existing clustering algorithms are mainly...
Zhen He, Richard Lai, Alonso Marquez, Stephen Blac...
JUCS
2010
148views more  JUCS 2010»
13 years 6 months ago
Applying RFD to Construct Optimal Quality-Investment Trees
: River Formation Dynamics (RFD) is an evolutionary computation method based on copying how drops form rivers by eroding the ground and depositing sediments. Given a cost-evaluated...
Pablo Rabanal, Ismael Rodríguez, Fernando R...
IJCV
2008
201views more  IJCV 2008»
13 years 7 months ago
Probabilistic Fusion of Stereo with Color and Contrast for Bi-Layer Segmentation
This paper describes two algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/contr...
Vladimir Kolmogorov, Antonio Criminisi, Andrew Bla...
DAM
2010
92views more  DAM 2010»
13 years 7 months ago
Average-case analysis of incremental topological ordering
Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates...
Deepak Ajwani, Tobias Friedrich
NIPS
2008
13 years 9 months ago
Non-stationary dynamic Bayesian networks
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
Joshua W. Robinson, Alexander J. Hartemink