Results 1  10
of
10,352
Indexing by latent semantic analysis
 JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE
, 1990
"... A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higherorder structure in the association of terms with documents (“semantic structure”) in order to improve the detection of relevant documents on the basis of terms found in queries. The p ..."
Abstract

Cited by 3779 (35 self)
 Add to MetaCart
are represented as pseudodocument vectors formed from weighted combinations of terms, and documents with suprathreshold cosine values are returned. initial tests find this completely automatic method for retrieval to be promising.
A distributed algorithm for minimumweight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract

Cited by 435 (3 self)
 Add to MetaCart
A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm
A fast learning algorithm for deep belief nets
 Neural Computation
, 2006
"... We show how to use “complementary priors ” to eliminate the explaining away effects that make inference difficult in denselyconnected belief nets that have many hidden layers. Using complementary priors, we derive a fast, greedy algorithm that can learn deep, directed belief networks one layer at a ..."
Abstract

Cited by 970 (49 self)
 Add to MetaCart
at a time, provided the top two layers form an undirected associative memory. The fast, greedy algorithm is used to initialize a slower learning procedure that finetunes the weights using a contrastive version of the wakesleep algorithm. After finetuning, a network with three hidden layers forms a
What is a hidden Markov model?
, 2004
"... Often, problems in biological sequence analysis are just a matter of putting the right label on each residue. In gene identification, we want to label nucleotides as exons, introns, or intergenic sequence. In sequence alignment, we want to associate residues in a query sequence with homologous resi ..."
Abstract

Cited by 1344 (8 self)
 Add to MetaCart
splice site consenses, codon bias, exon/intron length preferences, and open reading frame analysis all in one scoring system. How should all those parameters be set? How should different kinds of information be weighted? A second issue is being able to interpret results probabilistically. Finding a best
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
to the correct marginals. However, on the QMR network, the loopy be liefs oscillated and had no obvious relation ship to the correct posteriors. We present some initial investigations into the cause of these oscillations, and show that some sim ple methods of preventing them lead to the wrong results
Spectral Initiation Weighting Function Modified
"... Atmospheric CO2 concentrations, have been successfully retrieved from spectral measurements made in the near infrared (NIR) by the SCIAMACHY instrument, using a new retrieval algorithm called Full ..."
Abstract
 Add to MetaCart
Atmospheric CO2 concentrations, have been successfully retrieved from spectral measurements made in the near infrared (NIR) by the SCIAMACHY instrument, using a new retrieval algorithm called Full
Initial Weight Computation Method with Rapid Convergence
"... This paper presents a rapid initial weight computation method for adaptive array antennas. The proposed method estimates a correlation matrix using not only samples received with the desired signal but also those received from other sources. The proposed method reduces the number of known symbols re ..."
Abstract
 Add to MetaCart
This paper presents a rapid initial weight computation method for adaptive array antennas. The proposed method estimates a correlation matrix using not only samples received with the desired signal but also those received from other sources. The proposed method reduces the number of known symbols
Greedy layerwise training of deep networks
, 2006
"... Complexity theory of circuits strongly suggests that deep architectures can be much more efficient (sometimes exponentially) than shallow architectures, in terms of computational elements required to represent some functions. Deep multilayer neural networks have many levels of nonlinearities allow ..."
Abstract

Cited by 394 (48 self)
 Add to MetaCart
the optimization, by initializing weights in a region near a good local minimum, giving rise to internal distributed representations that are highlevel abstractions of the input, bringing better generalization.
Sparse signal reconstruction from limited data using FOCUSS: A reweighted minimum norm algorithm
 IEEE TRANS. SIGNAL PROCESSING
, 1997
"... We present a nonparametric algorithm for finding localized energy solutions from limited data. The problem we address is underdetermined, and no prior knowledge of the shape of the region on which the solution is nonzero is assumed. Termed the FOcal Underdetermined System Solver (FOCUSS), the algor ..."
Abstract

Cited by 368 (22 self)
 Add to MetaCart
), the algorithm has two integral parts: a lowresolution initial estimate of the real signal and the iteration process that refines the initial estimate to the final localized energy solution. The iterations are based on weighted norm minimization of the dependent variable with the weights being a function
INITIAL WEIGHTLOSS: A PRELIMINARY ENQUIRY BY
, 1952
"... There are two main theories on this subject: that the loss is due to the trauma of the birth process (Cole, 1939) and that it is due to lack of nourishment, to that delay in the comingin of the milk which seems to be normal in human mothers. There are also two views as to what should be done about ..."
Abstract
 Add to MetaCart
this loss, some saying that it is natural and may continue, others that it is harmful and should be stopped. At the same time some say that the average loss 'on the third day postpartum ' is 38 % of the birth weight (Kotz and Kaufman, 1939), others that it averages 4 5 % over the first few days
Results 1  10
of
10,352