Sciweavers

4874 search results - page 894 / 975
» Information theory for data management
Sort
View
SPAA
2010
ACM
14 years 10 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
CASES
2006
ACM
15 years 3 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
FLAIRS
2004
14 years 11 months ago
Inducing Fuzzy Decision Trees in Non-Deterministic Domains using CHAID
Most decision tree induction methods used for extracting knowledge in classification problems are unable to deal with uncertainties embedded within the data, associated with human...
Jay Fowdar, Zuhair Bandar, Keeley A. Crockett
CATA
2003
14 years 11 months ago
A Genetic Algorithm Approach to Static Task Scheduling in a Reconfigurable Hardware Environment
This paper presents a basic framework for applying static task scheduling techniques to arbitrarily-structured task systems whose targeted execution environment is comprised of fi...
Sin Ming Loo, B. Earl Wells, J. D. Winningham
TIFS
2008
129views more  TIFS 2008»
14 years 9 months ago
On Empirical Recognition Capacity of Biometric Systems Under Global PCA and ICA Encoding
Performance of biometric-based recognition systems depends on various factors: database quality, image preprocessing, encoding techniques, etc. Given a biometric database and a se...
Natalia A. Schmid, Francesco Nicolo