Computer Science Chung-Cheng University Chia-Yi, Taiwan sw@cs.ccu.edu.tw Udi Manber1 Department of Computer Science University of Arizona Tucson, AZ 85721 udi@cs.arizona.edu May 1994 SUMMARY A new algorithm to search for multiple patterns at the same time is presented. The algorithm is faster than previous algorithms and can support a very large number — tens of thousands — of patterns. Several applications ...
algorithm
multi
pattern
searching
Speeding up the Parti-Game Algorithm Maxim Likhachev School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 maxim+@cs.cmu.edu Sven Koenig College of Computing Georgia Institute of Technology Atlanta, GA 30312-0280 skoenig@cc.gatech.edu ...
speeding
parti
algorithm
Yoav Freund AT&T Labs 180 Park Avenue Florham Park, NJ 07932, USA October 2, 2000 Abstract We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorithm with the adaptivity of AdaBoost. The method used for making ...
adaptive
version
boost
majority
algorithm
A fast learning algorithm for deep belief nets Geoffrey E. Hinton and Simon Osindero Yee-Whye Teh Department of Computer Science University of Toronto 10 Kings College Road Toronto, Canada M5S 3G4 {hinton, osindero}@cs.toronto.edu ...
learning
algorithm
belief
Collaborative Signal Processing for Action Recognition in Body Sensor Networks: A Distributed Classi?cation Algorithm Using Motion Transcripts Hassan Ghasemzadeh, Vitali Loseu, Roozbeh Jafari Embedded Systems and Signal Processing Lab, Department of Electrical Engineering University of Texas at Dallas, Richardson, TX ...
collaborative
signal
processing
action
recognition
sensor
networks
distributed
classi
cation
algorithm
using
motion
transcripts
1 Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model Ron Rubinstein, Member, IEEE, Tomer Faktor and Michael Elad, Fellow, IEEE Abstract The synthesis-based sparse representation model for signals has drawn considerable interest ...
analysis
dictionary
learning
algorithm
sparse
model
SUMMARY Appel and Jacobson1 presented a fast algorithm for generating every possible move in a given position in the game of Scrabble using a DAWG, a finite automaton derived from the trie of a large lexicon. This paper presents a faster algorithm that ...
faster
scrabble
generation
algorithm
department
mathematics
carolina
university
greenville
to users. Some applications need bandwidth reservations at an earlier time so that desired QoS requirement could be ensured in the future. In this paper, we propose a new bandwidth management algorithm for advance reservation. The main design principle underlying our algorithm is adaptive online control based on real time estimation. This online approach is dynamic and flexible that responds to current ...
adaptive
advance
reservation
algorithm
sensitive
multimedia
networks
to run garbage collected virtual machines. The custom CPU includes a read barrier instruction. The read barrier enables a highly concurrent (no stop-the-world phases), parallel and compacting GC algorithm. The Pauseless algorithm is de- signed for uninterrupted application execution and consistent mutator throughput in every GC phase. Beyond the basic requirement of collecting faster than the allo- cation ...
pauseless
algorithm
Advanced Data Structures and Algorithm Analysis Laboratory Project 1 Binary Search Tree Date: 2009-12-03 Project 1 Binary Search Trees Chapter 1: Introduction After learning the general binary search tree in Fundamentals of Data Structures, ...
advanced
structures
algorithm
analysis
