Abstract. We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound i...
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
In an attempt to overcome problems associated with articulatory limitations and generative models, this work considers the use of phonological features in discriminative models fo...
We have investigated the register file requirements of dynamically scheduled processors using register renaming and dispatch queues running the SPEC92 benchmarks. We looked at pro...
: Most of Knowledge Discovery in Database (KDD) systems are integrating efficient Machine Learning techniques. In fact issues in Machine Learning and KDD are very close allowing fo...
Jean-Daniel Zucker, Vincent Corruble, J. Thomas, G...