7129 search results - page 544 / 1426 » Approximation Algorithms for Treewidth |
226
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
175
Voted
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
314
click to vote
VLDB
2009
ACM
16 years 7 months ago
2009
ACM
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
163
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
196
click to vote
ISNN
2009
Springer
16 years 1 months ago
2009
Springer
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...