Sciweavers

73 search results - page 12 / 15
» Online memory compression for embedded systems
Sort
View
143
Voted
ANCS
2009
ACM
14 years 11 months ago
SPC-FA: synergic parallel compact finite automaton to accelerate multi-string matching with low memory
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
Junchen Jiang, Yi Tang, Bin Liu, Xiaofei Wang, Yan...
ICCV
2009
IEEE
16 years 6 months ago
Feature-Centric Efficient Subwindow Search
embedded in a sliding-window scheme. Such exhaustive search involves massive computation. Efficient Subwindow Search (ESS) [11] avoids this by means of branch and bound. However...
Alain Lehmann, Bastian Leibe, Luc van Gool
GLOBECOM
2010
IEEE
14 years 12 months ago
Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching
Multi-string matching is a key technique for implementing network security applications like Network Intrusion Detection Systems (NIDS) and anti-virus scanners. Existing DFA-based ...
Yi Tang, Junchen Jiang, Xiaofei Wang, Bin Liu, Yan...
LCTRTS
2007
Springer
15 years 8 months ago
Frequency-aware energy optimization for real-time periodic and aperiodic tasks
Energy efficiency is an important factor in embedded systems design. We consider an embedded system with a dynamic voltage scaling (DVS) capable processor and its system-wide pow...
Xiliang Zhong, Cheng-Zhong Xu
ITCC
2002
IEEE
15 years 6 months ago
The Object Behavior of Java Object-Oriented Database Management Systems
Due to its portability and popularity for Internet applications, Java has become one of the major programming languages. The similar syntax inherited from the C language and the p...
Chia-Tien Dan Lo, J. Morris Chang, Ophir Frieder, ...