Sciweavers

1161 search results - page 177 / 233
» Approximation schemes for clustering problems
Sort
View
JMLR
2010
149views more  JMLR 2010»
13 years 2 months ago
Coherent Inference on Optimal Play in Game Trees
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Philipp Hennig, David H. Stern, Thore Graepel

Publication
197views
12 years 3 months ago
Convex non-negative matrix factorization for massive datasets
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...
C. Thurau, K. Kersting, M. Wahabzada, and C. Bauck...
SPAA
1997
ACM
13 years 11 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 7 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
EVOW
2010
Springer
14 years 2 months ago
WiMAX Network Planning Using Adaptive-Population-Size Genetic Algorithm
Abstract. IEEE 802.16, also known as WiMAX, is a new wireless access technology for currently increasing demand of wireless high-speed broadband service. Efficient and effective d...
Ting Hu, Yuanzhu Peter Chen, Wolfgang Banzhaf