761 search results - page 39 / 153 » Efficient Approximation Algorithms for the Subset-Sums Equal... |
FAW
2010
Springer
13 years 8 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
HIS
2009
13 years 5 months ago
2009
This paper presents a novel optimization approach using Improved Harmony Search (IHS) algorithm to solve economic power dispatch problem. The proposed methodology easily takes care...
TCS
2008
13 years 7 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractic...