Sciweavers

920 search results - page 54 / 184
» Computing the Frequency of Partial Orders
Sort
View
ICPR
2002
IEEE
14 years 3 months ago
Feasibility of Hough-Transform-Based Iris Localisation for Real-Time-Application
We present a fast method for locating iris features in frontal face images based on the Hough transform. It consists of an initial iris detection step and a tracking step which us...
Klaus D. Tönnies, Frank Behrens, Melanie Aurn...
TWC
2010
13 years 4 months ago
A Reduced-Complexity PTS-Based PAPR Reduction Scheme for OFDM Systems
In this paper, a reduced-complexity partial transmit sequences (PTS) scheme is proposed to resolve the intrinsic high peak-to-average power ratio (PAPR) problem of orthogonal frequ...
Sheng-Ju Ku, Chin-Liang Wang, Chiuan-Hsu Chen
TCAD
1998
95views more  TCAD 1998»
13 years 9 months ago
A framework for comparing models of computation
—We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general term...
Edward A. Lee, Alberto L. Sangiovanni-Vincentelli
ECIR
2008
Springer
13 years 11 months ago
Computing Information Retrieval Performance Measures Efficiently in the Presence of Tied Scores
Abstract. The Information Retrieval community uses a variety of performance measures to evaluate the effectiveness of scoring functions. In this paper, we show how to adapt six pop...
Frank McSherry, Marc Najork
SODA
1990
ACM
49views Algorithms» more  SODA 1990»
13 years 11 months ago
Factor Refinement
Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...
Eric Bach, James R. Driscoll, Jeffrey Shallit