Sciweavers

7930 search results - page 1247 / 1586
» Greedy in Approximation Algorithms
Sort
View
KAIS
2006
126views more  KAIS 2006»
15 years 6 months ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
SIAMSC
2008
168views more  SIAMSC 2008»
15 years 6 months ago
Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi
ATAL
2011
Springer
14 years 6 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
16 years 8 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 8 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...
« Prev « First page 1247 / 1586 Last » Next »