Sciweavers

4171 search results - page 691 / 835
» Distributed Data Structure Design for Scientific Computation
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 7 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
AAAI
2006
15 years 7 months ago
Using an Ontology for Knowledge Acquisition
We describe an approach to distributed knowledge acquisition using an ontology. The ontology is used to represent and reason about soldier performance. These methods are embedded ...
Stacy Lovell, Webb Stacy
PAISI
2010
Springer
15 years 4 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
BMCBI
2010
125views more  BMCBI 2010»
15 years 6 months ago
NeatMap - non-clustering heat map alternatives in R
Background: The clustered heat map is the most popular means of visualizing genomic data. It compactly displays a large amount of data in an intuitive format that facilitates the ...
Satwik Rajaram, Yoshi Oono
IEEEPACT
2009
IEEE
16 years 1 months ago
Soft-OLP: Improving Hardware Cache Performance through Software-Controlled Object-Level Partitioning
—Performance degradation of memory-intensive programs caused by the LRU policy’s inability to handle weaklocality data accesses in the last level cache is increasingly serious ...
Qingda Lu, Jiang Lin, Xiaoning Ding, Zhao Zhang, X...