Sciweavers

7129 search results - page 1080 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
16 years 5 months ago
On Efficient Query Processing of Stream Counts on the Cell Processor
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
Dina Thomas, Rajesh Bordawekar, Charu C. Aggarwal,...
ICDE
1998
IEEE
270views Database» more  ICDE 1998»
16 years 5 months ago
Cyclic Association Rules
We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may...
Banu Özden, Sridhar Ramaswamy, Abraham Silber...
229
Voted
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 4 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
WWW
2007
ACM
16 years 4 months ago
A scalable application placement controller for enterprise data centers
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
Chunqiang Tang, Malgorzata Steinder, Mike Spreitze...
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
16 years 4 months ago
Cut-and-stitch: efficient parallel learning of linear dynamical systems on smps
Multi-core processors with ever increasing number of cores per chip are becoming prevalent in modern parallel computing. Our goal is to make use of the multi-core as well as multi...
Lei Li, Wenjie Fu, Fan Guo, Todd C. Mowry, Christo...
« Prev « First page 1080 / 1426 Last » Next »