Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Charles Slivinsky

dblp:57/4147 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Biometric security · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Biometric security › biometric authentication
keystroke dynamics authentication
0.011990
Computer-Access Security Systems Using Keystroke Dynamics · IEEE Trans. Pattern Anal. Mach. Intell. 1990

Methods — techniques the papers use, named apart from their topics

time-duration measurement · 0.0pattern recognition · 0.0
YearPublicationVenuePosition
1990 Computer-Access Security Systems Using Keystroke Dynamics
abstract
An approach to securing access to computer systems is described. By performing real-time measurements of the time durations between the keystrokes when a password is entered and using pattern-recognition algorithms, three online recognition systems were devised and tested. Two types of passwords were considered: phrases and individual names. A fixed phrase was used in the identification system. Individual names were used as a password in the verification system and in the overall recognition system. All three systems were tested and evaluated. The identification system used 10 volunteers and gave an indecision error of 1.2%. The verification system used 26 volunteers and gave an error of 8.1% in rejecting valid users and an error of 2.8% in accepting invalid users. The overall recognition system used 32 volunteers and gave an error of 3.1% in rejecting valid users and an error of 0.5% in accepting invalid users.>
Saleh Bleha, Charles Slivinsky, Bassam Hussien
IEEE Trans. Pattern Anal. Mach. Intell.2
1987 Estimation approach to locating buried geological interfaces
abstract
The objective of the estimation work described in this paper is to improve algorithms for reconstructing the geometric configuration of acoustic reflecting surfaces. The conventional migration method of locating these surfaces is reviewed. A recent imaging condition which is closely related to the boundary condition at the geological interface is then described. This later procedure results in two outputs. One can be used to reconstruct the shape of the unknown acoustic reflector, while the second output estimates the acoustic wavespeed on the transmission side of the boundary. When noise is present in the reflected signal, the performance of the method is degraded. To improve the performance an empirical model for the noisy reflected signal is proposed, and its parameters are estimated. Computer-generated synthetic data are used to test the performance of the algorithms for a SNR range of -10dB to 10dB and for both normal incidence and non-normal incidence.
Abdulmagid Omar, Abdussalam Addeeb, Charles Slivinsky, Richard DuBroff
ICASSP3