Sciweavers

195 search results - page 8 / 39
» Cluster-based find and replace
Sort
View
ISCAPDCS
2003
13 years 8 months ago
Efficient Data Allocation for a Cluster of Workstations
The development and use of cluster based computing is increasingly becoming an effective approach for solving high performance computing problems. The trend of moving away from sp...
Ahmed M. Mohamed, Reda A. Ammar, Lester Lipsky
CATS
2006
13 years 8 months ago
Boolean equation solving as graph traversal
We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by iteratively approximating until a fixed ...
Brian Herlihy, Peter Schachte, Harald Sønde...
APAL
2006
72views more  APAL 2006»
13 years 6 months ago
Constructive algebraic integration theory
For a long time people have been trying to develop probability theory starting from `finite' events rather than collections of infinite events. In this way one can find natura...
Bas Spitters
ICDM
2007
IEEE
179views Data Mining» more  ICDM 2007»
14 years 1 months ago
GDClust: A Graph-Based Document Clustering Technique
This paper introduces a new technique of document clustering based on frequent senses. The proposed system, GDClust (Graph-Based Document Clustering) works with frequent senses ra...
M. Shahriar Hossain, Rafal A. Angryk
DBA
2004
113views Database» more  DBA 2004»
13 years 8 months ago
A Quality Measure for Distributed Clustering
Clustering has become an increasingly important task in modern application domains. Mostly, the data are originally collected at different sites. In order to extract information f...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle