Sciweavers

2715 search results - page 173 / 543
» An Implementation of Narrowing Strategies
Sort
View
ICCV
2009
IEEE
16 years 11 months ago
Large Displacement Optical Flow Computation without Warping
We propose an algorithm for large displacement opti- cal flow estimation which does not require the commonly used coarse-to-fine warping strategy. It is based on a quadratic rel...
Frank Steinbrucker, Thomas Pock, Daniel Cremers
ICIP
2005
IEEE
16 years 7 months ago
Redundant-wavelet watermarking with pixel-wise masking
An algorithm is presented which implements image watermarking in the domain of an overcomplete, or redundant, wavelet transform. This algorithm expands on a previous method which ...
Kristen M. Parker, James E. Fowler
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
16 years 7 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
SOFSEM
2009
Springer
16 years 3 months ago
From Outermost Termination to Innermost Termination
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
René Thiemann
EVOW
2010
Springer
16 years 1 months ago
Evolving Behaviour Trees for the Commercial Game DEFCON
Abstract. Behaviour trees provide the possibility of improving on existing Artificial Intelligence techniques in games by being simple to implement, scalable, able to handle the c...
Chong-U Lim, Robin Baumgarten, Simon Colton