• 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 21 - 30 of 24,105
Next 10 →

Segmentation of brain MR images through a hidden Markov random field model and the expectation-maximization algorithm

by Yongyue Zhang, Michael Brady, Stephen Smith - IEEE TRANSACTIONS ON MEDICAL. IMAGING , 2001
"... The finite mixture (FM) model is the most commonly used model for statistical segmentation of brain magnetic resonance (MR) images because of its simple mathematical form and the piecewise constant nature of ideal brain MR images. However, being a histogram-based model, the FM has an intrinsic limi ..."
Abstract - Cited by 639 (15 self) - Add to MetaCart
limitation—no spatial information is taken into account. This causes the FM model to work only on well-defined images with low levels of noise; unfortunately, this is often not the the case due to artifacts such as partial volume effect and bias field distortion. Under these conditions, FM model

Gibbs Sampling Methods for Stick-Breaking Priors

by Hemant Ishwaran, Lancelot F. James
"... ... In this paper we present two general types of Gibbs samplers that can be used to fit posteriors of Bayesian hierarchical models based on stick-breaking priors. The first type of Gibbs sampler, referred to as a Polya urn Gibbs sampler, is a generalized version of a widely used Gibbs sampling meth ..."
Abstract - Cited by 388 (19 self) - Add to MetaCart
... In this paper we present two general types of Gibbs samplers that can be used to fit posteriors of Bayesian hierarchical models based on stick-breaking priors. The first type of Gibbs sampler, referred to as a Polya urn Gibbs sampler, is a generalized version of a widely used Gibbs sampling

Social Networks and Labor-Market Outcomes: Towards an Economic Analysis

by James D. Montgomery - American Economic Review , 1991
"... prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtai ..."
Abstract - Cited by 474 (0 self) - Add to MetaCart
prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may

X-means: Extending K-means with Efficient Estimation of the Number of Clusters

by Dau Pelleg, Andrew Moore - In Proceedings of the 17th International Conf. on Machine Learning , 2000
"... Despite its popularity for general clustering, K-means suffers three major shortcomings; it scales poorly computationally, the number of clusters K has to be supplied by the user, and the search is prone to local minima. We propose solutions for the first two problems, and a partial remedy for the t ..."
Abstract - Cited by 418 (5 self) - Add to MetaCart
for the third. Building on prior work for algorithmic acceleration that is not based on approximation, we introduce a new algorithm that efficiently, searches the space of cluster locations and number of clusters to optimize the Bayesian Information Criterion (BIC) or the Akaike Information Criterion (AIC

Real-time simultaneous localisation and mapping with a single camera

by Andrew J. Davison , 2003
"... Ego-motion estimation for an agile single camera moving through general, unknown scenes becomes a much more challenging problem when real-time performance is required rather than under the off-line processing conditions under which most successful structure from motion work has been achieved. This t ..."
Abstract - Cited by 439 (21 self) - Add to MetaCart
Ego-motion estimation for an agile single camera moving through general, unknown scenes becomes a much more challenging problem when real-time performance is required rather than under the off-line processing conditions under which most successful structure from motion work has been achieved

Detecting Space-Time Clusters: Prior Work and

by New Directions Daniel, Daniel B. Neill, Andrew W. Moore , 2005
"... The problem of space-time cluster detection arises in a variety of applications, including disease surveillance and brain imaging. In this work, we briefly review the state of the art in space-time cluster detection, focusing on space-time scan statistics, and we derive a number of new statistics. F ..."
Abstract - Add to MetaCart
The problem of space-time cluster detection arises in a variety of applications, including disease surveillance and brain imaging. In this work, we briefly review the state of the art in space-time cluster detection, focusing on space-time scan statistics, and we derive a number of new statistics

Prior Work Our Approach Experimental Results

by T. Hoang Ngan Le, Khoa Luu, Keshav Seshadri, Prof Marios Savvides
"... ..."
Abstract - Add to MetaCart
Abstract not found

SlImmary.-Prior work indicatesitems for the Rathus Assertiveness

by Patricia Kearney, Michael J. Beatiy, Timothy G. Plax, James, C. Mccroskey
"... commonfactor,apprehensionaboutinterpersonalencounters.Employinga revisedmeasureof apprehension,factoranalysisof responsesof 160maleand 144femaleundergraduatesto thesetwo scalesyieldedfive factors:apprehen-sion aboutcommunicatingin groupsand meetings,apprehensionin inter-personalcontexts,apprehension ..."
Abstract - Add to MetaCart
commonfactor,apprehensionaboutinterpersonalencounters.Employinga revisedmeasureof apprehension,factoranalysisof responsesof 160maleand 144femaleundergraduatesto thesetwo scalesyieldedfive factors:apprehen-sion aboutcommunicatingin groupsand meetings,apprehensionin inter-personalcontexts,apprehensionin public speakingcontexts,preventingothers fromtakingadvantage,andcontentiousness.Only onecommonfactor,appre-hensionin interpersonalcontexts,wassharedby itemsfrom both scales. Assertivenessrefersto the abilityto makerequests,activelydisagree; expresspersonalrightsandfeelings;initiate,maintain,or disengagefromcon-versations;andto standup for self (3, 6, 17, 19). Attemptsto increase assertivenesshavetypicallyfocusedon shapingboth verbaland nonverbal commu:1ication(1, 2), or alteringmaladaptiveanxietyresponsesin inter-personalconversations(14,21). As such,"Asserrivenessi definedin terms ofcommunication,andthemeasuremenrof assertivenessrelieson communica-tionbehaviors"(15,p. 491). Conceptuallysimilar,apprehensionaboutcorn-

Formal Methods: State of the Art and Future Directions

by Edmund M. Clarke, Jeannette M. Wing - ACM Computing Surveys , 1996
"... ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept, ACM Inc., 1515 Broadway, New York, N ..."
Abstract - Cited by 425 (6 self) - Add to MetaCart
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept, ACM Inc., 1515 Broadway, New York

Distributed Source Coding Using Syndromes (DISCUS): Design and Construction

by S. Sandeep Pradhan, Kannan Ramchandran - IEEE TRANS. INFORM. THEORY , 1999
"... We address the problem of distributed source coding, i.e. compression of correlated sources that are not co-located and/or cannot communicate with each other to minimize their joint description cost. In this work we tackle the related problem of compressing a source that is correlated with anothe ..."
Abstract - Cited by 407 (9 self) - Add to MetaCart
We address the problem of distributed source coding, i.e. compression of correlated sources that are not co-located and/or cannot communicate with each other to minimize their joint description cost. In this work we tackle the related problem of compressing a source that is correlated
Next 10 →
Results 21 - 30 of 24,105
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