Sciweavers

10608 search results - page 327 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
PSTV
1993
123views Hardware» more  PSTV 1993»
15 years 5 months ago
On the Verification of Temporal Properties
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
Patrice Godefroid, Gerard J. Holzmann
LCN
2007
IEEE
15 years 10 months ago
Emergency Evacuation using Wireless Sensor Networks
—This paper presents a distributed algorithm to direct evacuees to exits through arbitrarily complex building layouts in emergency situations. The algorithm finds the safest pat...
Matthew Barnes, Hugh Leather, D. K. Arvind
ICPR
2000
IEEE
15 years 8 months ago
Piecewise Linear Two-Dimensional Warping
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
Seiichi Uchida, Hiroaki Sakoe
119
Voted
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 4 months ago
A proof Procedure for Testing Membership in Regular Expressions
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
Keehang Kwon, Hong Pyo Ha, Jiseung Kim
CORR
2004
Springer
111views Education» more  CORR 2004»
15 years 3 months ago
Finding Approximate Palindromes in Strings Quickly and Simply
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
L. Allison