Results 1 - 10 of 33,986

How Iris Recognition Works

by John Daugman , 2003
"... Algorithms developed by the author for recogniz-ing persons by their iris patterns have now been tested in six field and laboratory trials, producing no false matches in several million comparison tests. The recognition principle is the failure of a test of statis-tical independence on iris phase st ..."
Abstract - Cited by 509 (4 self) - Add to MetaCart
with extremely high confidence. The high confidence levels are important because they al-low very large databases to be searched exhaustively (one-to-many “identification mode”) without making any false matches, despite so many chances. Biomet-rics lacking this property can only survive one-to-one (“verification

A Fast Marching Level Set Method for Monotonically Advancing Fronts

by J. A. Sethian - PROC. NAT. ACAD. SCI , 1995
"... We present a fast marching level set method for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation. Level set methods are numerical techniques for computing the position of propagating fronts. They rely on an initial value partial differential eq ..."
Abstract - Cited by 630 (24 self) - Add to MetaCart
We present a fast marching level set method for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation. Level set methods are numerical techniques for computing the position of propagating fronts. They rely on an initial value partial differential

Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,

by ] Richard Hackman , Grec R Oldham , 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract - Cited by 622 (2 self) - Add to MetaCart
with before the theory can be fully applied to real-world job design problems. First, means must be developed for measuring current levels of activation of individuals in actual work settings (cf. Thayer, 1967), and for assessing the "optimal level" of activation for different individuals. Until

Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations

by Jure Leskovec, Jon Kleinberg, Christos Faloutsos , 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract - Cited by 541 (48 self) - Add to MetaCart
, requires very few parameters (like the “flammability” of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study.

Learning probabilistic relational models

by Nir Friedman, Lise Getoor, Daphne Koller, Avi Pfeffer - In IJCAI , 1999
"... A large portion of real-world data is stored in commercial relational database systems. In contrast, most statistical learning methods work only with "flat " data representations. Thus, to apply these methods, we are forced to convert our data into a flat form, thereby losing much ..."
Abstract - Cited by 613 (30 self) - Add to MetaCart
A large portion of real-world data is stored in commercial relational database systems. In contrast, most statistical learning methods work only with "flat " data representations. Thus, to apply these methods, we are forced to convert our data into a flat form, thereby losing much

A volumetric method for building complex models from range images,”

by Brian Curless , Marc Levoy - in Proceedings of the 23rd annual conference on Computer graphics and interactive techniques. ACM, , 1996
"... Abstract A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction, ..."
Abstract - Cited by 1020 (17 self) - Add to MetaCart
, and robustness in the presence of outliers. Prior algorithms possess subsets of these properties. In this paper, we present a volumetric method for integrating range images that possesses all of these properties. Our volumetric representation consists of a cumulative weighted signed distance function. Working

A SOUND TYPE SYSTEM FOR SECURE FLOW ANALYSIS

by Dennis Volpano, Geoffrey Smith, Cynthia Irvine , 1996
"... Ensuring secure information ow within programs in the context of multiple sensitivity levels has been widely studied. Especially noteworthy is Denning's work in secure ow analysis and the lattice model [6][7]. Until now, however, the soundness of Denning's analysis has not been established ..."
Abstract - Cited by 540 (21 self) - Add to MetaCart
Ensuring secure information ow within programs in the context of multiple sensitivity levels has been widely studied. Especially noteworthy is Denning's work in secure ow analysis and the lattice model [6][7]. Until now, however, the soundness of Denning's analysis has not been

A Survey of Approaches to Automatic Schema Matching

by Erhard Rahm, Philip A. Bernstein - VLDB JOURNAL , 2001
"... Schema matching is a basic problem in many database application domains, such as data integration, E-business, data warehousing, and semantic query processing. In current implementations, schema matching is typically performed manually, which has significant limitations. On the other hand, previous ..."
Abstract - Cited by 1351 (51 self) - Add to MetaCart
research papers have proposed many techniques to achieve a partial automation of the match operation for specific application domains. We present a taxonomy that covers many of these existing approaches, and we describe the approaches in some detail. In particular, we distinguish between schema-level

Live Migration of Virtual Machines

by Christopher Clark, Keir Fraser, Steven H, Jakob Gorm Hansen, Eric Jul, Christian Limpach, Ian Pratt, Andrew Warfield - In Proceedings of the 2nd ACM/USENIX Symposium on Networked Systems Design and Implementation (NSDI , 2005
"... Migrating operating system instances across distinct physical hosts is a useful tool for administrators of data centers and clusters: It allows a clean separation between hardware and software, and facilitates fault management, load balancing, and low-level system maintenance. By carrying out the ma ..."
Abstract - Cited by 636 (15 self) - Add to MetaCart
a practical tool even for servers running interactive loads. In this paper we consider the design options for migrating OSes running services with liveness constraints, focusing on data center and cluster environments. We introduce and analyze the concept of writable working set, and present

Social capital, intellectual capital, and the organizational advantage

by Janine Nahapiet - Academy of Management Review , 1998
"... Scholars of the theory of the firm have begun to emphasize the sources and conditions of what has been described a s "the organizational advantage, " rather than focus on the causes and consequences of market failure. Typically, researchers see such organizational advantage a s accruing fr ..."
Abstract - Cited by 1215 (2 self) - Add to MetaCart
settings. a re conducive to the development of high levels of social capital. and (3) it is because of their more dense social capital that firms. within certain limits. have a n advantage over markets in creating and sharing intellectual capital. We present a model that incorporates this overall argument
Results 1 - 10 of 33,986