• 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 4,503,623
Next 10 →

Condition number of Bott–Duffin inverse and their condition numbers

by Yimin Wei A, Wei Xu B
"... Various normwise relative condition numbers that measure the sensitivity of Bott– Duffin inverse and the solution of constrained linear systems are characterized. The sensitivity of condition number itself is then investigated. Finally, upper bounds are derived for the sensitivity of componentwise c ..."
Abstract - Add to MetaCart
Various normwise relative condition numbers that measure the sensitivity of Bott– Duffin inverse and the solution of constrained linear systems are characterized. The sensitivity of condition number itself is then investigated. Finally, upper bounds are derived for the sensitivity of componentwise

On the condition number of the . . .

by Marco Donatelli , Martin Hanke - LINEAR ALGEBRA AND ITS APPLICATIONS , 2010
"... ..."
Abstract - Add to MetaCart
Abstract not found

The ordinal numbers

by Grzegorz Bancerek - Journal of Formalized Mathematics , 1989
"... Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here Cantor-Bernstein theorem and oth ..."
Abstract - Cited by 722 (70 self) - Add to MetaCart
Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here Cantor-Bernstein theorem

The fundamental properties of natural numbers

by Grzegorz Bancerek - Journal of Formalized Mathematics , 1989
"... Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1.h ..."
Abstract - Cited by 682 (76 self) - Add to MetaCart
. The scheme Ind concerns a unary predicate P, and states that: For every natural number k holdsP[k] provided the parameters satisfy the following conditions: • P[0], and • For every natural number k such thatP[k] holdsP[k+1]. The scheme Nat Ind concerns a unary predicateP, and states that: For every natural

Analytic Number Theory

by Henryk Iwaniec, Emmanuel Kowalski - A.M.S COLLOQUIUM PUBL , 2004
"... ..."
Abstract - Cited by 584 (43 self) - Add to MetaCart
Abstract not found

Shallow Parsing with Conditional Random Fields

by Fei Sha, Fernando Pereira , 2003
"... Conditional random fields for sequence labeling offer advantages over both generative models like HMMs and classifiers applied at each sequence position. Among sequence labeling tasks in language processing, shallow parsing has received much attention, with the development of standard evaluati ..."
Abstract - Cited by 575 (8 self) - Add to MetaCart
Conditional random fields for sequence labeling offer advantages over both generative models like HMMs and classifiers applied at each sequence position. Among sequence labeling tasks in language processing, shallow parsing has received much attention, with the development of standard

Determining the Number of Factors in Approximate Factor Models

by Jushan Bai, Serena Ng , 2000
"... In this paper we develop some statistical theory for factor models of large dimensions. The focus is the determination of the number of factors, which is an unresolved issue in the rapidly growing literature on multifactor models. We propose a panel Cp criterion and show that the number of factors c ..."
Abstract - Cited by 538 (29 self) - Add to MetaCart
In this paper we develop some statistical theory for factor models of large dimensions. The focus is the determination of the number of factors, which is an unresolved issue in the rapidly growing literature on multifactor models. We propose a panel Cp criterion and show that the number of factors

On Bayesian analysis of mixtures with an unknown number of components

by Sylvia Richardson, Peter J. Green - INSTITUTE OF INTERNATIONAL ECONOMICS PROJECT ON INTERNATIONAL COMPETITION POLICY," COM/DAFFE/CLP/TD(94)42 , 1997
"... ..."
Abstract - Cited by 651 (24 self) - Add to MetaCart
Abstract not found

Contour Tracking By Stochastic Propagation of Conditional Density

by Michael Isard, Andrew Blake , 1996
"... . In Proc. European Conf. Computer Vision, 1996, pp. 343--356, Cambridge, UK The problem of tracking curves in dense visual clutter is a challenging one. Trackers based on Kalman filters are of limited use; because they are based on Gaussian densities which are unimodal, they cannot represent s ..."
Abstract - Cited by 658 (24 self) - Add to MetaCart
simultaneous alternative hypotheses. Extensions to the Kalman filter to handle multiple data associations work satisfactorily in the simple case of point targets, but do not extend naturally to continuous curves. A new, stochastic algorithm is proposed here, the Condensation algorithm --- Conditional

SEDA: An Architecture for Well-Conditioned, Scalable Internet Services

by Matt Welsh, David Culler, Eric Brewer , 2001
"... We propose a new design for highly concurrent Internet services, whichwe call the staged event-driven architecture (SEDA). SEDA is intended ..."
Abstract - Cited by 522 (10 self) - Add to MetaCart
We propose a new design for highly concurrent Internet services, whichwe call the staged event-driven architecture (SEDA). SEDA is intended
Next 10 →
Results 1 - 10 of 4,503,623
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