Results 21  30
of
7,312
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately
How Iris Recognition Works
, 2003
"... Algorithms developed by the author for recognizing persons by their iris patterns have now been tested in six field and laboratory trials, producing no false matches in several million comparison tests. The recognition principle is the failure of a test of statistical independence on iris phase st ..."
Abstract

Cited by 509 (4 self)
 Add to MetaCart
Algorithms developed by the author for recognizing persons by their iris patterns have now been tested in six field and laboratory trials, producing no false matches in several million comparison tests. The recognition principle is the failure of a test of statistical independence on iris phase
Online and Offline Handwriting Recognition: A Comprehensive Survey
 IEEE Transactions on Pattern Analysis and Machine Intelligence
"... AbstractÐHandwriting has continued to persist as a means of communication and recording information in daytoday life even with the introduction of new technologies. Given its ubiquity in human transactions, machine recognition of handwriting has practical significance, as in reading handwritten no ..."
Abstract

Cited by 495 (8 self)
 Add to MetaCart
notes in a PDA, in postal addresses on envelopes, in amounts in bank checks, in handwritten fields in forms, etc. This overview describes the nature of handwritten language, how it is transduced into electronic data, and the basic concepts behind written language recognition algorithms. Both the on
Distinctive Image Features from ScaleInvariant Keypoints
, 2003
"... This paper presents a method for extracting distinctive invariant features from images, which can be used to perform reliable matching between different images of an object or scene. The features are invariant to image scale and rotation, and are shown to provide robust matching across a a substa ..."
Abstract

Cited by 8955 (21 self)
 Add to MetaCart
describes an approach to using these features for object recognition. The recognition proceeds by matching individual features to a database of features from known objects using a fast nearestneighbor algorithm, followed by a Hough transform to identify clusters belonging to a single object
XM2VTSDB: The Extended M2VTS Database
 In Second International Conference on Audio and Videobased Biometric Person Authentication
, 1999
"... In this paper we describe the acquisition and content of a large multimodal database intended for training and testing of multimodal verification systems. The XM2VTSDB database offers synchronised video and speech data as well as image sequences allowing multiple views of the face. It consists of ..."
Abstract

Cited by 438 (40 self)
 Add to MetaCart
of digital video recordings taken of 295 hundred subjects at one month intervals taken over a period of five months. We also describe a protocol for evaluating verification algorithms on the database. The database has been made available to anyone on request to the University of Surrey through http
A Simpler Minimum Spanning Tree Verification Algorithm
 Algorithmica
, 1995
"... The problem considered here is that of determining whether a given spanning tree is a minimM spanning tree. In 1984, Koml6s presented an Mgorithm which required only a linear number of comparisons, but nonlinear overhead to determine which comparisons to make. We simplify his Mgorithm and give a ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
The problem considered here is that of determining whether a given spanning tree is a minimM spanning tree. In 1984, Koml6s presented an Mgorithm which required only a linear number of comparisons, but nonlinear overhead to determine which comparisons to make. We simplify his Mgorithm and give a linear time procedure for its implementation in the unit cost RAM model. The procedure uses table lookup of a few simple functions, which we precompute in time linear in the size of the tree.
Ridge Orientation Estimation and Verification Algorithm for Fingerprint Enhancement
"... Abstract: Fingerprint image enhancement is a common and critical step in fingerprint recognition systems. To enhance the images, most of the existing enhancement algorithms use filtering techniques that can be categorized into isotropic and anisotropic according to the filter kernel. Isotropic filte ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
and verification algorithm which can not only generate an orientation of ridge flows, but also verify its reliability. Experimental results show that, on average, over 51 percent of an image in the NIST4 database has reliable orientations. Based on this algorithm, a hybrid fingerprint enhancement algorithm
A note on onthefly verification algorithms
 In Proc. of TACAS’05, LNCS
, 2005
"... Abstract. The automatatheoretic approach to verification of LTL relies on an algorithm for finding accepting cycles in the product of the system and a B"uchi automaton for the negation of the formula. Explicitstate model checkers typically construct the product space "on the fly ..."
Abstract

Cited by 35 (3 self)
 Add to MetaCart
Abstract. The automatatheoretic approach to verification of LTL relies on an algorithm for finding accepting cycles in the product of the system and a B"uchi automaton for the negation of the formula. Explicitstate model checkers typically construct the product space "on the fly
Efficient Verification Algorithms for OneCounter Processes
, 2000
"... We study the problem of strong/weak bisimilarity between processes of onecounter automata and finitestate processes. We show that the problem of weak bisimilarity between processes of onecounter nets (which are `weak' onecounter automata) and finitestate processes is DPhard (in partic ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
particular, it means that the problem is both NP and coNP hard). The same technique is used to demonstrate coNPhardness of strong bisimilarity between processes of onecounter nets. Then we design an algorithm which decides weak bisimilarity between processes of onecounter automata and finite
Model Checking for Programming Languages using VeriSoft
 IN PROCEEDINGS OF THE 24TH ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
, 1997
"... Verification by statespace exploration, also often referred to as "model checking", is an effective method for analyzing the correctness of concurrent reactive systems (e.g., communication protocols). Unfortunately, existing modelchecking techniques are restricted to the verification of ..."
Abstract

Cited by 446 (15 self)
 Add to MetaCart
Verification by statespace exploration, also often referred to as "model checking", is an effective method for analyzing the correctness of concurrent reactive systems (e.g., communication protocols). Unfortunately, existing modelchecking techniques are restricted to the verification
Results 21  30
of
7,312