Results 1  10
of
5,519
UNIVERSAL IDENTITIES
"... We want to describe an idea which reduces the verification of algebraic identities valid over all commutative rings to the verification over the complex numbers, where special tools (from linear algebra, geometry, or analysis) are available. What is meant by an algebraic identity valid over all comm ..."
Abstract
 Add to MetaCart
We want to describe an idea which reduces the verification of algebraic identities valid over all commutative rings to the verification over the complex numbers, where special tools (from linear algebra, geometry, or analysis) are available. What is meant by an algebraic identity valid over all
A Validation Of ObjectOriented Design Metrics As Quality Indicators
 IEEE Transactions on Software Engineering
, 1995
"... This paper presents the results of a study conducted at the University of Maryland in which we experimentally investigated the suite of ObjectOriented (OO) design metrics introduced by [Chidamber&Kemerer, 1994]. In order to do this, we assessed these metrics as predictors of faultprone clas ..."
Abstract

Cited by 439 (19 self)
 Add to MetaCart
This paper presents the results of a study conducted at the University of Maryland in which we experimentally investigated the suite of ObjectOriented (OO) design metrics introduced by [Chidamber&Kemerer, 1994]. In order to do this, we assessed these metrics as predictors of fault
A Theory of Program Size Formally Identical to Information Theory
, 1975
"... A new definition of programsize complexity is made. H(A;B=C;D) is defined to be the size in bits of the shortest selfdelimiting program for calculating strings A and B if one is given a minimalsize selfdelimiting program for calculating strings C and D. This differs from previous definitions: (1) ..."
Abstract

Cited by 380 (15 self)
 Add to MetaCart
concept of information theory. For example, H(A;B) = H(A) + H(B=A) + O(1). Also, if a program of length k is assigned measure 2 \Gammak , then H(A) = \Gamma log 2 (the probability that the standard universal computer will calculate A) +O(1). Key Words and Phrases: computational complexity, entropy
When Is "Nearest Neighbor" Meaningful?
 In Int. Conf. on Database Theory
, 1999
"... . We explore the effect of dimensionality on the "nearest neighbor " problem. We show that under a broad set of conditions (much broader than independent and identically distributed dimensions), as dimensionality increases, the distance to the nearest data point approaches the distance ..."
Abstract

Cited by 408 (2 self)
 Add to MetaCart
. We explore the effect of dimensionality on the "nearest neighbor " problem. We show that under a broad set of conditions (much broader than independent and identically distributed dimensions), as dimensionality increases, the distance to the nearest data point approaches
The Universal Protein Resource (UniProt): an expanding universe of protein information
 Nucleic Acids Res
, 2006
"... The Universal Protein Resource (UniProt) provides a central resource on protein sequences and functional annotation with three database components, each addressing a key need in protein bioinformatics. The UniProt Knowledgebase (UniProtKB), comprising the manually annotated UniProtKB/SwissProt sec ..."
Abstract

Cited by 302 (20 self)
 Add to MetaCart
The Universal Protein Resource (UniProt) provides a central resource on protein sequences and functional annotation with three database components, each addressing a key need in protein bioinformatics. The UniProt Knowledgebase (UniProtKB), comprising the manually annotated Uni
Relational Queries Computable in Polynomial Time
 Information and Control
, 1986
"... We characterize the polynomial time computable queries as those expressible in relational calculus plus a least fixed point operator and a total ordering on the universe. We also show that even without the ordering one application of fixed point suffices to express any query expressible with several ..."
Abstract

Cited by 318 (17 self)
 Add to MetaCart
We characterize the polynomial time computable queries as those expressible in relational calculus plus a least fixed point operator and a total ordering on the universe. We also show that even without the ordering one application of fixed point suffices to express any query expressible
Managing University Identity Management Systems: A Design Science Approach
"... Abstract: Especially in the university context the configuration of identity management systems, the management of roles and their assignment to users is a highly complex task. Tosimplify this we propose an automated linking ofthe identity management system to business process models which contain o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: Especially in the university context the configuration of identity management systems, the management of roles and their assignment to users is a highly complex task. Tosimplify this we propose an automated linking ofthe identity management system to business process models which contain
Automated Learning of Decision Rules for Text Categorization
 ACM Transactions on Information Systems
, 1994
"... We describe the results of extensive experiments on large document collections using optimized rulebased induction methods. The goal of these methods is to automatically discover classification patterns that can be used for general document categorization or personalized filtering of free text. ..."
Abstract

Cited by 311 (8 self)
 Add to MetaCart
, while using the identical rulebased representation. In comparison with other machine learning techniques, results on a key benchmark from the Reuters collection show a large gain in performance, from a previously reported 65% recall/precision breakeven point to 80.5%. In the context of a very high
Information fusion in biometrics
 Pattern Recognition Letters
, 2003
"... User verification systems that use a single biometric indicator often have to contend with noisy sensor data, restricted degrees of freedom, nonuniversality of the biometric trait and unacceptable error rates. Attempting to improve the performance of individual matchers in such situations may not p ..."
Abstract

Cited by 292 (17 self)
 Add to MetaCart
User verification systems that use a single biometric indicator often have to contend with noisy sensor data, restricted degrees of freedom, nonuniversality of the biometric trait and unacceptable error rates. Attempting to improve the performance of individual matchers in such situations may
Berzonsky, Kuk / TRANSITION TO UNIVERSITY Identity Status, Identity Processing Style, and the Transition to University
, 2000
"... The present study investigated the role that differences in identity orientations may play as students negotiate the transition to a university context. Measures of identity status, identity processing style, and student developmental tasks were administered to 363 entering university freshmen. Resu ..."
Abstract
 Add to MetaCart
The present study investigated the role that differences in identity orientations may play as students negotiate the transition to a university context. Measures of identity status, identity processing style, and student developmental tasks were administered to 363 entering university freshmen
Results 1  10
of
5,519