2137 search results - page 378 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
129
click to vote
JCDL
2005
ACM
15 years 7 months ago
2005
ACM
Recommender systems can provide valuable services in a digital library environment, as demonstrated by its commercial success in book, movie, and music industries. One of the most...
118
click to vote
ILP
2003
Springer
15 years 7 months ago
2003
Springer
In many data mining tools that support regression tasks, training data are stored in a single table containing both the target field (dependent variable) and the attributes (indepe...
138
click to vote
SSDBM
1999
IEEE
15 years 6 months ago
1999
IEEE
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
123
click to vote
JMLR
2010
14 years 8 months ago
2010
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, ...
130
click to vote
CISS
2011
IEEE
14 years 5 months ago
2011
IEEE
—In this work we address the problem of state estimation in dynamical systems using recent developments in compressive sensing and sparse approximation. We formulate the traditio...