Sciweavers

2192 search results - page 97 / 439
» Algorithms for Challenging Motif Problems
Sort
View
KAIS
2008
150views more  KAIS 2008»
13 years 8 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 8 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
ASPDAC
2007
ACM
112views Hardware» more  ASPDAC 2007»
14 years 6 days ago
Efficient Second-Order Iterative Methods for IR Drop Analysis in Power Grid
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
Yu Zhong, Martin D. F. Wong
PR
2008
88views more  PR 2008»
13 years 8 months ago
Modified global k
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
Adil M. Bagirov
ECAI
2010
Springer
13 years 8 months ago
Optimal Task Migration in Service-Oriented Systems: Algorithms and Mechanisms
In service-oriented systems, such as grids and clouds, users are able to outsource complex computational tasks by procuring resources on demand from remote service providers. As th...
Sebastian Stein, Enrico Gerding, Nicholas R. Jenni...