Sciweavers

6437 search results - page 550 / 1288
» Parallel Algorithms for Arrangements
Sort
View
IFIP12
2008
15 years 8 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
IPPS
2009
IEEE
16 years 1 months ago
Multi-dimensional characterization of temporal data mining on graphics processors
Through the algorthmic design patterns of data parallelism and task parallelism, the graphics processing unit (GPU) offers the potential to vastly accelerate discovery and innovat...
Jeremy S. Archuleta, Yong Cao, Thomas Scogland, Wu...
IPPS
2008
IEEE
16 years 1 months ago
Programmability of the HPCS Languages: A case study with a quantum chemistry kernel
As high-end computer systems present users with rapidly increasing numbers of processors, possibly also incorporating attached co-processors, programmers are increasingly challeng...
Aniruddha G. Shet, Wael R. Elwasif, Robert J. Harr...
IPPS
2007
IEEE
16 years 1 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
VECPAR
2004
Springer
16 years 6 days ago
Domain Decomposition Methods for PDE Constrained Optimization Problems
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
Ernesto E. Prudencio, Richard H. Byrd, Xiao-Chuan ...