Sciweavers

1984 search results - page 41 / 397
» Binary Component Adaptation
Sort
View
JFP
2006
113views more  JFP 2006»
14 years 9 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
ICML
2009
IEEE
15 years 10 months ago
Binary action search for learning continuous-action control policies
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
Jason Pazis, Michail G. Lagoudakis
ICIP
2008
IEEE
15 years 4 months ago
Dynamic background modeling and subtraction using spatio-temporal local binary patterns
Traditional background modeling and subtraction methods have a strong assumption that the scenes are of static structures with limited perturbation. These methods will perform poo...
Shengping Zhang, Hongxun Yao, Shaohui Liu
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 8 months ago
Precisely Analyzing Loss in Interface Adapter Chains
Interface adaptation allows code written for one interface to be used with a software component with another interface. When multiple adapters are chained together to make certain...
Yoo Chung
IEEEPACT
2009
IEEE
15 years 4 months ago
Chainsaw: Using Binary Matching for Relative Instruction Mix Comparison
With advances in hardware, instruction set architectures are undergoing continual evolution. As a result, compilers are under constant pressure to adapt and take full advantage of...
Tipp Moseley, Dirk Grunwald, Ramesh Peri