Sciweavers

3750 search results - page 299 / 750
» Timed Automata Patterns
Sort
View
IPL
2007
91views more  IPL 2007»
15 years 4 months ago
Simple deterministic wildcard matching
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
Peter Clifford, Raphaël Clifford
ICDE
2008
IEEE
301views Database» more  ICDE 2008»
16 years 6 months ago
A Hybrid Prediction Model for Moving Objects
Existing prediction methods in moving objects databases cannot forecast locations accurately if the query time is far away from the current time. Even for near future prediction, m...
Hoyoung Jeung, Qing Liu, Heng Tao Shen, Xiaofang Z...
TSP
2010
14 years 11 months ago
LS-CS-residual (LS-CS): compressive sensing on least squares residual
We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy...
Namrata Vaswani
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
15 years 10 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
185
Voted
ADAEUROPE
2005
Springer
15 years 10 months ago
Non-intrusive System Level Fault-Tolerance
This paper describes the methodology used to add nonintrusive system-level fault tolerance to an electronic throttle controller. The original model of the throttle controller is a...
Kristina Lundqvist, Jayakanth Srinivasan, Sé...