Results 11  20
of
2,164,196
Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
, 1997
"... We develop a face recognition algorithm which is insensitive to gross variation in lighting direction and facial expression. Taking a pattern classification approach, we consider each pixel in an image as a coordinate in a highdimensional space. We take advantage of the observation that the images ..."
Abstract

Cited by 2263 (18 self)
 Add to MetaCart
from this linear subspace. Rather than explicitly modeling this deviation, we linearly project the image into a subspace in a manner which discounts those regions of the face with large deviation. Our projection method is based on Fisher's Linear Discriminant and produces well separated classes
On the algorithmic implementation of multiclass kernelbased vector machines
 Journal of Machine Learning Research
"... In this paper we describe the algorithmic implementation of multiclass kernelbased vector machines. Our starting point is a generalized notion of the margin to multiclass problems. Using this notion we cast multiclass categorization problems as a constrained optimization problem with a quadratic ob ..."
Abstract

Cited by 547 (14 self)
 Add to MetaCart
significant running time improvements for large datasets. Finally, we describe various experiments with our approach comparing it to previously studied kernelbased methods. Our experiments indicate that for multiclass problems we attain stateoftheart accuracy.
A densitybased algorithm for discovering clusters in large spatial databases with noise
, 1996
"... Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clu ..."
Abstract

Cited by 1722 (69 self)
 Add to MetaCart
Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery
Mining Association Rules between Sets of Items in Large Databases
 IN: PROCEEDINGS OF THE 1993 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, WASHINGTON DC (USA
, 1993
"... We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel esti ..."
Abstract

Cited by 3260 (17 self)
 Add to MetaCart
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel
Making LargeScale Support Vector Machine Learning Practical
, 1998
"... Training a support vector machine (SVM) leads to a quadratic optimization problem with bound constraints and one linear equality constraint. Despite the fact that this type of problem is well understood, there are many issues to be considered in designing an SVM learner. In particular, for large lea ..."
Abstract

Cited by 620 (1 self)
 Add to MetaCart
Training a support vector machine (SVM) leads to a quadratic optimization problem with bound constraints and one linear equality constraint. Despite the fact that this type of problem is well understood, there are many issues to be considered in designing an SVM learner. In particular, for large
QSplat: A Multiresolution Point Rendering System for Large Meshes
, 2000
"... Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing and p ..."
Abstract

Cited by 500 (8 self)
 Add to MetaCart
be computed quickly, making it suitable for large data sets. Our implementation, written for use in a largescale 3D digitization project, launches quickly, maintains a usersettable interactive frame rate regardless of object complexity or camera position, yields reasonable image quality during motion
GPFS: A SharedDisk File System for Large Computing Clusters
 In Proceedings of the 2002 Conference on File and Storage Technologies (FAST
, 2002
"... GPFS is IBM's parallel, shareddisk file system for cluster computers, available on the RS/6000 SP parallel supercomputer and on Linux clusters. GPFS is used on many of the largest supercomputers in the world. GPFS was built on many of the ideas that were developed in the academic community ove ..."
Abstract

Cited by 518 (3 self)
 Add to MetaCart
existing ideas scaled well, new approaches were necessary in many key areas. This paper describes GPFS, and discusses how distributed locking and recovery techniques were extended to scale to large clusters.
GromovWitten classes, quantum cohomology, and enumerative geometry
 Commun. Math. Phys
, 1994
"... The paper is devoted to the mathematical aspects of topological quantum field theory and its applications to enumerative problems of algebraic geometry. In particular, it contains an axiomatic treatment of Gromov–Witten classes, and a discussion of their properties for Fano varieties. Cohomological ..."
Abstract

Cited by 484 (3 self)
 Add to MetaCart
The paper is devoted to the mathematical aspects of topological quantum field theory and its applications to enumerative problems of algebraic geometry. In particular, it contains an axiomatic treatment of Gromov–Witten classes, and a discussion of their properties for Fano varieties. Cohomological
The Complete Atomic Structure of the Large Ribosomal Subunit at 2.4 Å Resolution
 Science
, 2000
"... ation, and termination phases of protein synthesis. Because the structures of several DNA and RNA polymerases have been determined at atomic resolution, the mechanisms of DNA and RNA synthesis are both well understood. Determination of the structure of the ribosome, however, has proven a daunting t ..."
Abstract

Cited by 529 (13 self)
 Add to MetaCart
ation, and termination phases of protein synthesis. Because the structures of several DNA and RNA polymerases have been determined at atomic resolution, the mechanisms of DNA and RNA synthesis are both well understood. Determination of the structure of the ribosome, however, has proven a daunting task. It is several times larger than the largest polymerase, and 100 times larger than lysozyme, the first enzyme to be understood at atomic resolution. Until now an atomic resolution structure for the ribosome has not been available, and as a result the mechanism of protein synthesis has remained a mystery. Electron microscopy has contributed to our understanding of ribosome structure ever since the ribosome was discovered. In the last few years, threedimensional (3D) electron microscopic images of the ribosome have been produced at resolutions sufficiently high to visualize many of the proteins and nucleic acids that assist in protein synthesis bound to the ribosome (3). Earlier this yea
An Efficient ContextFree Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract

Cited by 794 (0 self)
 Add to MetaCart
; it has an n 2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical contextfree programming language grammars. In an empirical comparison it appears to be superior to the topdown and bottomup algorithms studied by Griffiths
Results 11  20
of
2,164,196