Sciweavers

1945 search results - page 57 / 389
» Speeding up Serpent
Sort
View
PPSN
2010
Springer
14 years 9 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
ANCS
2009
ACM
14 years 9 months ago
A NFA-based programmable regular expression match engine
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
Derek Pao
ASSETS
2009
ACM
14 years 9 months ago
Fall and emergency detection with mobile phones
In this demo, we present an application for mobile phones which can monitor physical activities of users and detect unexpected emergency situations such as a sudden fall or accide...
Hamed Ketabdar, Tim Polzehl
EMNLP
2009
14 years 9 months ago
How well does active learning
Machine involvement has the potential to speed up language documentation. We assess this potential with timed annotation experiments that consider annotator expertise, example sel...
Jason Baldridge, Alexis Palmer
ICCAD
2009
IEEE
98views Hardware» more  ICCAD 2009»
14 years 9 months ago
GHM: A generalized Hamiltonian method for passivity test of impedance/admittance descriptor systems
A generalized Hamiltonian method (GHM) is proposed for passivity test of descriptor systems (DSs) which describe impedance or admittance input-output responses. GHM can test passi...
Zheng Zhang, Chi-Un Lei, Ngai Wong