Sciweavers

6365 search results - page 294 / 1273
» Fast Local Computation Algorithms
Sort
View
DAC
2006
ACM
16 years 7 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
AUSAI
2001
Springer
15 years 10 months ago
Fast Text Classification Using Sequential Sampling Processes
A central problem in information retrieval is the automated classification of text documents. While many existing methods achieve good levels of performance, they generally require...
Michael D. Lee

Source Code
445views
16 years 7 months ago
Blocks
Blocks is an open source modular MATLAB framework which allows the user to avoid needlessly repeating computation. Blocks may be easily used for your own experiments, and comes ...
Brian Fulkerson, Andrea Vedaldi
JAIR
2002
163views more  JAIR 2002»
15 years 6 months ago
Efficient Reinforcement Learning Using Recursive Least-Squares Methods
The recursive least-squares (RLS) algorithm is one of the most well-known algorithms used in adaptive filtering, system identification and adaptive control. Its popularity is main...
Xin Xu, Hangen He, Dewen Hu
SIAMSC
2010
159views more  SIAMSC 2010»
15 years 1 months ago
The Fast Generalized Gauss Transform
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
Marina Spivak, Shravan K. Veerapaneni, Leslie Gree...