Sciweavers

3457 search results - page 414 / 692
» A Symbol Is Not a Symbol
Sort
View
ISAAC
2003
Springer
117views Algorithms» more  ISAAC 2003»
16 years 22 hour ago
Approximate Regular Expression Searching with Arbitrary Integer Weights
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
Gonzalo Navarro
DATE
2010
IEEE
173views Hardware» more  DATE 2010»
15 years 12 months ago
Robust design of embedded systems
—This paper presents a methodology to evaluate and optimize the robustness of an embedded system in terms of invariability in case of design revisions. Early decisions in embedde...
Martin Lukasiewycz, Michael Glaß, Jürge...
ACSC
2002
IEEE
15 years 11 months ago
Enhanced Word-Based Block-Sorting Text Compression
The Block Sorting process of Burrows and Wheeler can be applied to any sequence in which symbols are (or might be) conditioned upon each other. In particular, it is possible to pa...
R. Yugo Kartono Isal, Alistair Moffat, A. C. H. Ng...
ATS
2002
IEEE
118views Hardware» more  ATS 2002»
15 years 11 months ago
Diagnosis Of Byzantine Open-Segment Faults
This paper addresses the problem of locating the stuckopen faults in a manufactured IC with scan flip-flops. Unlike most previous methods that only aim at identifying the faulty s...
Shi-Yu Huang
CLUSTER
2002
IEEE
15 years 11 months ago
Supermon: A High-Speed Cluster Monitoring System
Supermon is a flexible set of tools for high speed, scalable cluster monitoring. Node behavior can be monitored much faster than with other commonly used methods (e.g., rstatd). ...
Matthew J. Sottile, Ronald Minnich