Sciweavers

7978 search results - page 754 / 1596
» Combining shared-coin algorithms
Sort
View
ICDM
2002
IEEE
191views Data Mining» more  ICDM 2002»
16 years 13 days ago
Iterative Clustering of High Dimensional Text Data Augmented by Local Search
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
Inderjit S. Dhillon, Yuqiang Guan, J. Kogan
PDP
2002
IEEE
16 years 12 days ago
Eventually Consistent Failure Detectors
The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to sol...
Mikel Larrea, Antonio Fernández, Sergio Ar&...
AUSSOIS
2001
Springer
16 years 14 hour ago
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
Adam N. Letchford, Andrea Lodi
FPGA
2001
ACM
145views FPGA» more  FPGA 2001»
16 years 1 hour ago
Simultaneous logic decomposition with technology mapping in FPGA designs
Conventional technology mapping algorithms for SRAM-based Field Programmable Gate Arrays (FPGAs) are normally carried out on a fixed logic decomposition of a circuit. The impact o...
Gang Chen, Jason Cong
ICPADS
2000
IEEE
15 years 12 months ago
Parallel Spatial Joins Using Grid Files
The most costly spatial operation in spatial databases is a spatial join with combines objects from two data sets based on spatial predicates. Even if the execution time of sequen...
Jin-Deog Kim, Bonghee Hong