• 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 32,199
Next 10 →

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

LogP: Towards a Realistic Model of Parallel Computation

by David Culler , Richard Karp , David Patterson, Abhijit Sahay, Klaus Erik Schauser, Eunice Santos, Ramesh Subramonian, Thorsten von Eicken , 1993
"... A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding developme ..."
Abstract - Cited by 560 (15 self) - Add to MetaCart
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding

A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II

by Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, T Meyarivan , 2000
"... Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) -4 computational complexity (where is the number of objectives and is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing ..."
Abstract - Cited by 662 (15 self) - Add to MetaCart
sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algorithm (we called it the Non-dominated Sorting GA-II or NSGA-II) which alleviates all the above three difficulties. Specifically, a fast non-dominated sorting approach with computational

Mixtures of Probabilistic Principal Component Analysers

by Michael E. Tipping, Christopher M. Bishop , 1998
"... Principal component analysis (PCA) is one of the most popular techniques for processing, compressing and visualising data, although its effectiveness is limited by its global linearity. While nonlinear variants of PCA have been proposed, an alternative paradigm is to capture data complexity by a com ..."
Abstract - Cited by 532 (6 self) - Add to MetaCart
maximum-likelihood framework, based on a specific form of Gaussian latent variable model. This leads to a well-defined mixture model for probabilistic principal component analysers, whose parameters can be determined using an EM algorithm. We discuss the advantages of this model in the context

On the Use of Windows for Harmonic Analysis With the Discrete Fourier Transform

by Fredric J. Harris - Proc. IEEE , 1978
"... Ahmw-This Pw!r mak = available a concise review of data win- compromise consists of applying windows to the sampled daws pad the ^ affect On the Of in the data set, or equivalently, smoothing the spectral samples. '7 of aoise9 m the ptesence of sdroag bar- The two operations to which we subject ..."
Abstract - Cited by 668 (0 self) - Add to MetaCart
, windowing is less related to sampled windows for DFT's. HERE IS MUCH signal processing devoted to detection and estimation. Detection is the task of determiningif a specific signal set is present in an observation, while estimation is the task of obtaining the values of the parameters

Income and Wealth Heterogeneity in the Macroeconomy,

by Per Krusell , Anthony A Smith Jr , Mark Huggett , Robert Lucas , Víctor Ríos-Rull , Tom Sargent , José Scheinkman , Chris Telmer , Stan Zin - Journal of Political Economy , 1998
"... How do movements in the distribution of income and wealth affect the macroeconomy? We analyze this question using a calibrated version of the stochastic growth model with partially uninsurable idiosyncratic risk and movements in aggregate productivity. Our main finding is that, in the stationary st ..."
Abstract - Cited by 678 (11 self) - Add to MetaCart
stochastic equilibrium, the behavior of the macroeconomic aggregates can be almost perfectly described using only the mean of the wealth distribution. This result is robust to substantial changes in both parameter values and model specification. Our benchmark model, whose only difference from

Versatile Low Power Media Access for Wireless Sensor Networks

by Joseph Polastre, Jason Hill, David Culler , 2004
"... We propose B-MAC, a carrier sense media access protocol for wireless sensor networks that provides a flexible interface to obtain ultra low power operation, effective collision avoidance, and high channel utilization. To achieve low power operation, B-MAC employs an adaptive preamble sampling scheme ..."
Abstract - Cited by 1099 (19 self) - Add to MetaCart
applications. We use the model to show the effect of changing B-MAC’s parameters and predict the behavior of sensor network applications. By comparing B-MAC to conventional 802.11inspired protocols, specifically S-MAC, we develop an experimental characterization of B-MAC over a wide range of network conditions

Improved Boosting Algorithms Using Confidence-rated Predictions

by Robert E. Schapire , Yoram Singer - MACHINE LEARNING , 1999
"... We describe several improvements to Freund and Schapire’s AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each of their predictions. We give a simplified analysis of AdaBoost in this setting, and we show how this analysis can be used to find impr ..."
Abstract - Cited by 940 (26 self) - Add to MetaCart
improved parameter settings as well as a refined criterion for training weak hypotheses. We give a specific method for assigning confidences to the predictions of decision trees, a method closely related to one used by Quinlan. This method also suggests a technique for growing decision trees which turns

A Fast and Elitist Multi-Objective Genetic Algorithm: NSGA-II

by Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, T. Meyarivan , 2000
"... Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) O(MN computational complexity (where M is the number of objectives and N is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing param ..."
Abstract - Cited by 1815 (60 self) - Add to MetaCart
parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algorithm (we called it the Non-dominated Sorting GA-II or NSGA-II) which alleviates all the above three difficulties. Specifically, a fast non-dominated sorting approach with O(MN ) computational complexity

Learning User-Specific Parameters In A Multibiometric System

by Anil K. Jain, Arun Ross , 2002
"... Biometric systems that use a single biometric trait have to contend with noisy data, restricted degrees of freedom, failureto -enroll problems, spoof attacks, and unacceptable error rates. Multibiometric systems that use multiple traits of an individual for authentication, alleviate some of these pr ..."
Abstract - Cited by 104 (14 self) - Add to MetaCart
of these problems while improving verification performance. We demonstrate that the performance of multibiometric systems can be further improved by learning user-specific parameters. Two types of parameters are considered here. (i) Thresholds that are used to decide if a matching score indicates a genuine user
Next 10 →
Results 1 - 10 of 32,199
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