Sciweavers

539 search results - page 9 / 108
» The N R One Time Password System
Sort
View
COMPGEOM
1994
ACM
13 years 11 months ago
Computing Many Faces in Arrangements of Lines and Segments
We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previo...
Pankaj K. Agarwal, Jirí Matousek, Otfried S...
VISUALIZATION
1996
IEEE
13 years 11 months ago
Three Dimensional Visualization of Proteins in Cellular Interactions
In researching the communication mechanisms between cells of the immune system, visualization of proteins in three dimensions can be used to determine which proteins are capable o...
Colin R. F. Monks, Patricia Crossno, George S. Dav...
CIARP
2003
Springer
14 years 9 days ago
Online Handwritten Signature Verification Using Hidden Markov Models
Most people are used to signing documents and because of this, it is a trusted and natural method for user identity verification, reducing the cost of password maintenance and decr...
Juan J. Igarza, Iñaki Goirizelaia, Koldo Es...
FSTTCS
2001
Springer
13 years 11 months ago
The Directed Minimum-Degree Spanning Tree Problem
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
Radha Krishnan, Balaji Raghavachari
ICC
2007
IEEE
14 years 1 months ago
Joint Transmitter-Receiver Beamforming Over Space-Time Fading Channels
Abstract—The problem of joint transmitter and receiver beamforming in the downlink DS-CDMA over multipath fading channels is considered in this paper. The proposed investigation ...
Tingting Zhang, Athanassios Manikas