Sciweavers

1449 search results - page 266 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
PKDD
2009
Springer
146views Data Mining» more  PKDD 2009»
15 years 7 months ago
Parallel Subspace Sampling for Particle Filtering in Dynamic Bayesian Networks
Monitoring the variables of real world dynamic systems is a difficult task due to their inherent complexity and uncertainty. Particle Filters (PF) perform that task, yielding prob...
Eva Besada-Portas, Sergey M. Plis, Jesús Ma...
FOCS
2000
IEEE
15 years 7 months ago
Fast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
Richard Cleve, John Watrous
ECAI
2000
Springer
15 years 6 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
DAC
1999
ACM
15 years 6 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
FCCM
1999
IEEE
111views VLSI» more  FCCM 1999»
15 years 6 months ago
Optimizing FPGA-Based Vector Product Designs
This paper presents a method, called multiple constant multiplier trees MCMTs, for producing optimized recon gurable hardware implementations of vector products. An algorithm for ...
Dan Benyamin, John D. Villasenor, Wayne Luk