Sciweavers

2258 search results - page 290 / 452
» Structured Sparsity in Structured Prediction
Sort
View
AAECC
2007
Springer
111views Algorithms» more  AAECC 2007»
15 years 5 months ago
When cache blocking of sparse matrix vector multiply works and why
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
Rajesh Nishtala, Richard W. Vuduc, James Demmel, K...
ML
2008
ACM
222views Machine Learning» more  ML 2008»
15 years 4 months ago
Boosted Bayesian network classifiers
The use of Bayesian networks for classification problems has received significant recent attention. Although computationally efficient, the standard maximum likelihood learning me...
Yushi Jing, Vladimir Pavlovic, James M. Rehg
ML
2006
ACM
15 years 4 months ago
Relational IBL in classical music
It is well known that many hard tasks considered in machine learning and data mining can be solved in a rather simple and robust way with an instanceand distance-based approach. In...
Asmir Tobudic, Gerhard Widmer
IJHPCA
2007
88views more  IJHPCA 2007»
15 years 4 months ago
Scaling Properties of Common Statistical Operators for Gridded Datasets
An accurate cost-model that accounts for dataset size and structure can help optimize geoscience data analysis. We develop and apply a computational model to estimate data analysi...
Charles S. Zender, Harry Mangalam
133
Voted
JUCS
2007
118views more  JUCS 2007»
15 years 4 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate