• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,293
Next 10 →

Face recognition using laplacianfaces

by Xiaofei He, Shuicheng Yan, Yuxiao Hu, Partha Niyogi, Hong-jiang Zhang - IEEE Transactions on Pattern Analysis and Machine Intelligence , 2005
"... Abstract—We propose an appearance-based face recognition method called the Laplacianface approach. By using Locality Preserving Projections (LPP), the face images are mapped into a face subspace for analysis. Different from Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) wh ..."
Abstract - Cited by 389 (38 self) - Add to MetaCart
approach with Eigenface and Fisherface methods on three different face data sets. Experimental results suggest that the proposed Laplacianface approach provides a better representation and achieves lower error rates in face recognition. Index Terms—Face recognition, principal component analysis, linear

Image Decomposition via the Combination of Sparse Representations and a Variational Approach

by J. -l. Starck, M. Elad, D.L. Donoho - IEEE Transactions on Image Processing , 2004
"... The separation of image content into semantic parts plays a vital role in applications such as compression, enhancement, restoration, and more. In recent years several pioneering works suggested such a separation based on variational formulation, and others using independent component analysis and s ..."
Abstract - Cited by 219 (28 self) - Add to MetaCart
texture or piecewise smooth). The use of the BPDN with the two augmented dictionaries leads to the desired separation, along with noise removal as a by-product. As the need to choose proper dictionaries is generally hard, a TV regularization is employed to better direct the separation process and reduce

A Minimally Fine-Tuned Supersymmetric Standard Model

by Z. Chacko A, Yasunori Nomura B, David Tucker-smith D , 2005
"... We construct supersymmetric theories in which the correct scale for electroweak symmetry breaking is obtained without significant fine-tuning. We calculate the fine-tuning parameter for these theories to be at the 20 % level, which is significantly better than in conventional supersymmetry breaking ..."
Abstract - Add to MetaCart
We construct supersymmetric theories in which the correct scale for electroweak symmetry breaking is obtained without significant fine-tuning. We calculate the fine-tuning parameter for these theories to be at the 20 % level, which is significantly better than in conventional supersymmetry breaking

A comparison of classifiers and document representations for the routing problem

by Hinrich Schütze, David A. Hull, Jan O. Pedersen - ANNUAL ACM CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL - ACM SIGIR , 1995
"... In this paper, we compare learning techniques based on statistical classification to traditional methods of relevance feedback for the document routing problem. We consider three classification techniques which have decision rules that are derived via explicit error minimization: linear discriminant ..."
Abstract - Cited by 196 (2 self) - Add to MetaCart
discriminant analysis, logistic regression, and neural networks. We demonstrate that the classifiers perform 1015 % better than relevance feedback via Rocchio expansion for the TREC-2 and TREC-3 routing tasks. Error minimization is difficult in high-dimensional feature spaces because the convergence process

Geometric engineering of quantum field theories

by Sheldon Katz, Albrecht Klemm, Cumrun Vafa - Nucl. Phys. B497 , 1997
"... Using the recent advances in our understanding of non-perturbative aspects of type II strings we show how non-trivial exact results for N = 2 quantum field theories can be reduced to T-dualities of string theory. This is done by constructing a local geometric realization of quantum field theories to ..."
Abstract - Cited by 229 (28 self) - Add to MetaCart
together with a local application of mirror symmetry. This construction is not based on any duality conjecture and thus reduces non-trivial quantum field theory results to much better understood T-dualities of type II strings. Moreover it can be used in principle to construct in a systematic way the vacuum

Efficient influence maximization in social networks

by Wei Chen, Yajun Wang, Siyu Yang - In Proc. of ACM KDD , 2009
"... Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the efficient influence maximization from two complementary directions. One is to improve the original greedy algorithm of [5 ..."
Abstract - Cited by 197 (18 self) - Add to MetaCart
. Based on our results, we believe that fine-tuned heuristics may provide truly scalable solutions to the influence maximization problem with satisfying influence spread and blazingly fast running time. Therefore, contrary to what implied by the conclusion of [5] that traditional heuristics

On the fine-tuning problem in minimal SO(10) SUSY-GUT

by Ralf Hempfling , 1995
"... In grand unified theories (GUT) based on SO(10) all fermions of one generation are embedded in a single representation. As a result, the top quark, the bottom quark, and the τ lepton have a universal Yukawa coupling at the GUT scale. This implies a very large ratio of Higgs vacuum expectation values ..."
Abstract - Add to MetaCart
is excessive. GUT threshold correction to the universal Higgs mass parameter can significantly reduce the fine-tuning required for such large values of tan β. We also point out that the top quark mass can play a crucial role in explaining the hierarchy between the SUSY breaking scale and the electro-weak scale

Processing Capacity Defined by Relational Complexity: Implications for Comparative, Developmental, and Cognitive Psychology

by Graeme S. Halford, William H. Wilson, Steven Phillips , 1989
"... It is argued that working memory limitations are best defined in terms of the complexity of relations that can be processed in parallel. Relational complexity is related to processing loads in problem solving, and discriminates between higher animal species, as well as between children of differen ..."
Abstract - Cited by 182 (14 self) - Add to MetaCart
not exceed processing capacity, and which are processed serially. Conceptual chunking entails "collapsing" representations to reduce their dimensionality and consequently their processing load, but at the cost of making some relational information inaccessible. Parallel distributed processing

UCB-PTH-05/11 LBNL-57427 A Minimally Fine-Tuned Supersymmetric Standard Model

by Z. Chacko A, Yasunori Nomura B, David Tucker-smith D , 2005
"... We construct supersymmetric theories in which the correct scale for electroweak symmetry breaking is obtained without significant fine-tuning. We calculate the fine-tuning parameter for these theories to be at the 20 % level, which is significantly better than in conventional supersymmetry breaking ..."
Abstract - Add to MetaCart
We construct supersymmetric theories in which the correct scale for electroweak symmetry breaking is obtained without significant fine-tuning. We calculate the fine-tuning parameter for these theories to be at the 20 % level, which is significantly better than in conventional supersymmetry breaking

Navigating and querying code without getting lost

by Doug Janzen, Kris De Volder - In Proceedings of Aspect Oriented Software Development , 2003
"... A development task related to a crosscutting concern is chal-lenging because a developer can easily get lost when explor-ing scattered elements of code and the complex tangle of re-lationships between them. In this paper we present a source browsing tool that improves the developer’s ability to work ..."
Abstract - Cited by 156 (6 self) - Add to MetaCart
to work with crosscutting concerns by providing better support for exploring code. Our tool helps the developer to remain ori-ented while exploring and navigating across a code base. The cognitive burden placed on a developer is reduced by avoiding disorienting view switches and by providing an ex
Next 10 →
Results 1 - 10 of 1,293
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University