Sciweavers

2621 search results - page 44 / 525
» Near orders and codes
Sort
View
ADVIS
2004
Springer
14 years 2 months ago
On Families of New Adaptive Compression Algorithms Suitable for Time-Varying Source Data
In this paper, we introduce a new approach to adaptive coding which utilizes Stochastic Learning-based Weak Estimation (SLWE) techniques to adaptively update the probabilities of t...
Luís G. Rueda, B. John Oommen
IPL
2006
80views more  IPL 2006»
13 years 10 months ago
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority al...
Neal Lesh, Michael Mitzenmacher
APAL
2006
113views more  APAL 2006»
13 years 11 months ago
Coding by club-sequences
Given any subset A of 1 there is a proper partial order which forces that the predicate x A and the predicate x 1\A can be expressed by ZFC
David Asperó
ICCAD
2000
IEEE
100views Hardware» more  ICCAD 2000»
14 years 3 months ago
Automated Data Dependency Size Estimation with a Partially Fixed Execution Ordering
For data dominated applications, the system level design trajectory should first focus on finding a good data transfer and storage solution. Since no realization details are avail...
Per Gunnar Kjeldsberg, Francky Catthoor, Einar J. ...
ICIP
1997
IEEE
15 years 11 days ago
Higher order local autocorrelation features of PARCOR images for gesture recognition
This paper proposes a feature extraction method for gesture recognition, which is based on higher order local autocorrelation (HLAC) of PARCOR images. To extract dominant informat...
Takio Kurita, Yasuo Kobayashi, Taketoshi Mishima