Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
25,965
A process matching approach . . .
, 2002
"... Matching between two workflow processes is the key step of workflow process reuse. This paper presents an inexact matching approach for flexible workflow process reuse. A multi-valued process specialization relationship is defined based on the defnition of activity specialization and the characteris ..."
Abstract
- Add to MetaCart
Matching between two workflow processes is the key step of workflow process reuse. This paper presents an inexact matching approach for flexible workflow process reuse. A multi-valued process specialization relationship is defined based on the defnition of activity specialization
EigenTracking: Robust Matching and Tracking of Articulated Objects Using a View-Based Representation
- International Journal of Computer Vision
, 1998
"... This paper describes an approach for tracking rigid and articulated objects using a view-based representation. The approach builds on and extends work on eigenspace representations, robust estimation techniques, and parameterized optical flow estimation. First, we note that the least-squares image r ..."
Abstract
-
Cited by 656 (16 self)
- Add to MetaCart
This paper describes an approach for tracking rigid and articulated objects using a view-based representation. The approach builds on and extends work on eigenspace representations, robust estimation techniques, and parameterized optical flow estimation. First, we note that the least-squares image
Face recognition: features versus templates
- IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... Over the last 20 years, several different techniques have been proposed for computer recognition of human faces. The purpose of this paper is to compare two simple but general strategies on a common database (frontal images of faces of 47 people: 26 males and 21 females, four images per person). We ..."
Abstract
-
Cited by 749 (25 self)
- Add to MetaCart
(about 90 % correct recognition using geometrical features and perfect recognition using template matching) favor our implementation of the template-matching approach.
A new approach to the maximum flow problem
- JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximum-flow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract
-
Cited by 672 (33 self)
- Add to MetaCart
All previously known efficient maximum-flow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length augmenting paths at once (using the layered network approach of Dinic). An alternative method based
An approach to correlate tandem mass spectral data of peptides with amino acid sequences in a protein database
- J. Am. Soc. Mass Spectrom
, 1994
"... A method to correlate the uninterpreted tandem mass spectra of peptides produced under low energy (lo-50 eV) collision conditions with amino acid sequences in the Genpept database has been developed. In this method the protein database is searched to identify linear amino acid sequences within a mas ..."
Abstract
-
Cited by 944 (19 self)
- Add to MetaCart
in the tandem mass spectrum. In general, a difference greater than 0.1 between the normalized cross-correlation functions of the first- and second-ranked search results indicates a successfol match between sequence and spectrum. Searches of species-specific protein databases with tandem mass spectra acquired
Distinctive Image Features from Scale-Invariant 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 nearest-neighbor algorithm, followed by a Hough transform to identify clusters belonging to a single object
A universal algorithm for sequential data compression
- IEEE TRANSACTIONS ON INFORMATION THEORY
, 1977
"... A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainabl ..."
Abstract
-
Cited by 1522 (7 self)
- Add to MetaCart
A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios
Using Linear Algebra for Intelligent Information Retrieval
- SIAM REVIEW
, 1995
"... Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical ..."
Abstract
-
Cited by 676 (18 self)
- Add to MetaCart
Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document
Results 11 - 20
of
25,965
