Sciweavers

5640 search results - page 134 / 1128
» Parallelizing the Data Cube
Sort
View
MICCAI
1998
Springer
14 years 1 months ago
Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data
This paper describes a method for creating object surfaces from binary-segmented data that are free from aliasing and terracing artifacts. In this method, a net of linked surface n...
Sarah F. Frisken Gibson
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
14 years 1 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
AUSDM
2006
Springer
177views Data Mining» more  AUSDM 2006»
14 years 24 days ago
On The Optimal Working Set Size in Serial and Parallel Support Vector Machine Learning With The Decomposition Algorithm
The support vector machine (SVM) is a wellestablished and accurate supervised learning method for the classification of data in various application fields. The statistical learnin...
Tatjana Eitrich, Bruno Lang
CF
2010
ACM
14 years 12 days ago
Hybrid parallel programming with MPI and unified parallel C
The Message Passing Interface (MPI) is one of the most widely used programming models for parallel computing. However, the amount of memory available to an MPI process is limited ...
James Dinan, Pavan Balaji, Ewing L. Lusk, P. Saday...
IPPS
2006
IEEE
14 years 3 months ago
An entropy-based algorithm for time-driven software instrumentation in parallel systems
While monitoring, instrumented long running parallel applications generate huge amount of instrumentation data. Processing and storing this data incurs overhead, and perturbs the ...
A. Ozmen