Sciweavers

6437 search results - page 103 / 1288
» Parallel Algorithms for Arrangements
Sort
View
ICPP
2000
IEEE
15 years 5 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
70
Voted
CORR
2007
Springer
93views Education» more  CORR 2007»
15 years 19 days ago
Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort
A generalization of the heapsort algorithm is proposed. At the expense of about 50% more comparison and move operations for typical cases, the dualheap sort algorithm offers sever...
Greg Sepesi
93
Voted
CLUSTER
2007
IEEE
15 years 7 months ago
Sequential and parallel implementation of a constraint-based algorithm for searching protein structures
— Data mining in biological structure libraries can be a powerful tool to better understand biochemical processes. This article introduces the LISA algorithm which enables the re...
Sascha Hunold, Thomas Rauber, Georg Wille
IPPS
2006
IEEE
15 years 6 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
ARITH
2003
IEEE
15 years 6 months ago
A New Iterative Structure for Hardware Division: The Parallel Paths Algorithm
This paper presents a new approach to hardware division—the parallel paths algorithm. In this approach, prescaling allows the division recurrence to be implemented by three proc...
Eric Rice, Richard Hughey