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

CiteSeerX logo

Advanced Search Include Citations

Tools

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

Linear Dependence

by Vladik Kreinovich, Hung T. Nguyen, Songsak Sriboonchitta
"... Abstract. In many practical situations, the dependence between the quantities is linear or approximately linear. Knowing that the dependence is linear simplifies computations; so, is is desirable to detect linear dependencies. If we know the joint probability distribution, we can detect linear depen ..."
Abstract - Add to MetaCart
Abstract. In many practical situations, the dependence between the quantities is linear or approximately linear. Knowing that the dependence is linear simplifies computations; so, is is desirable to detect linear dependencies. If we know the joint probability distribution, we can detect linear

Longitudinal data analysis using generalized linear models”.

by Kung-Yee Liang , Scott L Zeger - Biometrika, , 1986
"... SUMMARY This paper proposes an extension of generalized linear models to the analysis of longitudinal data. We introduce a class of estimating equations that give consistent estimates of the regression parameters and of their variance under mild assumptions about the time dependence. The estimating ..."
Abstract - Cited by 1526 (8 self) - Add to MetaCart
SUMMARY This paper proposes an extension of generalized linear models to the analysis of longitudinal data. We introduce a class of estimating equations that give consistent estimates of the regression parameters and of their variance under mild assumptions about the time dependence

Using Linear Algebra for Intelligent Information Retrieval

by Michael W. Berry, Susan T. Dumais - SIAM REVIEW , 1995
"... Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical ..."
Abstract - Cited by 676 (18 self) - Add to MetaCart
Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document

ON THE POWER OF LINEAR DEPENDENCIES

by Imre Bárány
"... Simple as they may be, linear dependencies have proved very useful in many ways. In this survey several geometric applications of linear dependencies are discussed, focusing on rearrangements of sums and on sums with ±1 signs. ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Simple as they may be, linear dependencies have proved very useful in many ways. In this survey several geometric applications of linear dependencies are discussed, focusing on rearrangements of sums and on sums with ±1 signs.

On linear dependence of iterates

by J. Matkowski, W. Zhang - J.Appl.Anal
"... Abstract. A functional equation related to a problem of linear depen-dence of iterates is considered. 1. ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Abstract. A functional equation related to a problem of linear depen-dence of iterates is considered. 1.

Optimally sparse representation in general (non-orthogonal) dictionaries via ℓ¹ minimization

by David L. Donoho, Michael Elad - PROC. NATL ACAD. SCI. USA 100 2197–202 , 2002
"... Given a ‘dictionary’ D = {dk} of vectors dk, we seek to represent a signal S as a linear combination S = ∑ k γ(k)dk, with scalar coefficients γ(k). In particular, we aim for the sparsest representation possible. In general, this requires a combinatorial optimization process. Previous work considered ..."
Abstract - Cited by 633 (38 self) - Add to MetaCart
optimization problem: specifically, minimizing the ℓ¹ norm of the coefficients γ. In this paper, we obtain parallel results in a more general setting, where the dictionary D can arise from two or several bases, frames, or even less structured systems. We introduce the Spark, ameasure of linear dependence

Efficiently computing static single assignment form and the control dependence graph

by Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck - ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS , 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract - Cited by 1003 (8 self) - Add to MetaCart
assignment form and the control dependence graph have been proposed to represent data flow and control flow propertiee of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimization. Although both of these structures are attractive

Locally linearly dependent operators

by Roy Meshulam, Roy Meshulam - Pacific J. Math
"... Let U and V be vector spaces over a field F. Linear op-erators T1,..., Tn: U → V are locally linearly dependent if T1u,..., Tnu are linearly dependent for every u ∈ U. We extend and unify known results on locally linearly dependent operators and present two applications of these new results, one in ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
Let U and V be vector spaces over a field F. Linear op-erators T1,..., Tn: U → V are locally linearly dependent if T1u,..., Tnu are linearly dependent for every u ∈ U. We extend and unify known results on locally linearly dependent operators and present two applications of these new results, one

Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and min-redundancy

by Hanchuan Peng, Fuhui Long, Chris Ding - IEEE TRANS. PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2005
"... Feature selection is an important problem for pattern classification systems. We study how to select good features according to the maximal statistical dependency criterion based on mutual information. Because of the difficulty in directly implementing the maximal dependency condition, we first der ..."
Abstract - Cited by 571 (8 self) - Add to MetaCart
Feature selection is an important problem for pattern classification systems. We study how to select good features according to the maximal statistical dependency criterion based on mutual information. Because of the difficulty in directly implementing the maximal dependency condition, we first

Survey on Independent Component Analysis

by Aapo Hyvärinen - NEURAL COMPUTING SURVEYS , 1999
"... A common problem encountered in such disciplines as statistics, data analysis, signal processing, and neural network research, is nding a suitable representation of multivariate data. For computational and conceptual simplicity, such a representation is often sought as a linear transformation of the ..."
Abstract - Cited by 2309 (104 self) - Add to MetaCart
A common problem encountered in such disciplines as statistics, data analysis, signal processing, and neural network research, is nding a suitable representation of multivariate data. For computational and conceptual simplicity, such a representation is often sought as a linear transformation
Next 10 →
Results 1 - 10 of 31,331
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