Sciweavers

4124 search results - page 144 / 825
» Improved Algorithms for Data Migration
Sort
View
117
Voted
ICDE
2005
IEEE
132views Database» more  ICDE 2005»
15 years 9 months ago
CLICKS: Mining Subspace Clusters in Categorical Data via K-partite Maximal Cliques
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...
Mohammed Javeed Zaki, Markus Peters
CORR
2008
Springer
127views Education» more  CORR 2008»
15 years 3 months ago
A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting
Compressed Counting (CC) was recently proposed for approximating the th frequency moments of data streams, for 0 < 2. Under the relaxed strict-Turnstile model, CC dramaticall...
Ping Li
ASPDAC
2006
ACM
102views Hardware» more  ASPDAC 2006»
15 years 9 months ago
An O(mn) time algorithm for optimal buffer insertion of nets with m sinks
— Buffer insertion is an effective technique to reduce interconnect delay. In this paper, we give a simple O(mn) time algorithm for optimal buffer insertion, where m is the numbe...
Zhuo Li, Weiping Shi
CVPR
2012
IEEE
13 years 5 months ago
Active image clustering: Seeking constraints from humans to complement algorithms
We propose a method of clustering images that combines algorithmic and human input. An algorithm provides us with pairwise image similarities. We then actively obtain selected, mo...
Arijit Biswas, David W. Jacobs
129
Voted
PPSN
1998
Springer
15 years 7 months ago
Genetic Algorithms for the Multiple Container Packing Problem
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
Günther R. Raidl, Gabriele Kodydek