Sciweavers

1314 search results - page 224 / 263
» Approximate data mining in very large relational data
Sort
View
JMLR
2008
209views more  JMLR 2008»
15 years 1 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
DEXA
2006
Springer
193views Database» more  DEXA 2006»
15 years 5 months ago
Understanding and Enhancing the Folding-In Method in Latent Semantic Indexing
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
Xiang Wang 0002, Xiaoming Jin
AMC
2004
108views more  AMC 2004»
15 years 1 months ago
A variational approach to magnetic resonance coil sensitivity estimation
Abstract. A variational method for estimating a magnetic resonance coil sensitivity from its corresponding nonuniform illumination of magnetic resonance images is proposed and anal...
Stephen L. Keeling, Roland Bammer
138
Voted
NN
2002
Springer
115views Neural Networks» more  NN 2002»
15 years 1 months ago
A self-organising network that grows when required
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow
QEST
2008
IEEE
15 years 8 months ago
KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes
We present the KPC-Toolbox, a collection of Matlab scripts for fitting workload traces into Markovian Arrival Processes (MAPs) in an automatic way. We first present detailed sen...
Giuliano Casale, Eddy Z. Zhang, Evgenia Smirni