Sciweavers

405 search results - page 61 / 81
» Efficient decision tree construction on streaming data
Sort
View
VLSID
2006
IEEE
86views VLSI» more  VLSID 2006»
14 years 7 months ago
Partial Product Reduction Based on Look-Up Tables
In this paper a new technique for partial product reduction based on the use of look-up tables for efficient processing is presented. We describe how to construct counter devices ...
F. Pujol López, Higinio Mora Mora, Jer&oacu...

Publication
404views
14 years 4 months ago
Bayesian variable order Markov models.
We present a simple, effective generalisation of variable order Markov models to full online Bayesian estimation. The mechanism used is close to that employed in context tree wei...
Christos Dimitrakakis
ECTEL
2007
Springer
14 years 1 months ago
Using MotSaRT to Support On-Line Teachers in Student Motivation
Motivation to learn is affected by a student’s self-efficacy, goal orientation, locus of control and perceived task difficulty. In the classroom, teachers know how to motivate th...
Teresa Hurley, Stephan Weibelzahl
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 2 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 1 months ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin