Sciweavers

6575 search results - page 748 / 1315
» Specializing visualization algorithms
Sort
View
SDM
2010
SIAM
149views Data Mining» more  SDM 2010»
15 years 8 months ago
Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization
Real-world relational data are seldom stationary, yet traditional collaborative filtering algorithms generally rely on this assumption. Motivated by our sales prediction problem, ...
Liang Xiong, Xi Chen, Tzu-Kuo Huang, Jeff Schneide...
IPCO
2007
143views Optimization» more  IPCO 2007»
15 years 8 months ago
On the Exact Separation of Mixed Integer Knapsack Cuts
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
Ricardo Fukasawa, Marcos Goycoolea
ICAI
2004
15 years 8 months ago
A Comparison of Resampling Methods for Clustering Ensembles
-- Combination of multiple clusterings is an important task in the area of unsupervised learning. Inspired by the success of supervised bagging algorithms, we propose a resampling ...
Behrouz Minaei-Bidgoli, Alexander P. Topchy, Willi...
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
15 years 8 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
15 years 8 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine