7129 search results - page 317 / 1426 » Approximation Algorithms for Treewidth |
159
click to vote
AIMSA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
145
click to vote
NIPS
2007
15 years 6 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
142
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
151
click to vote
SIAMSC
2008
15 years 4 months ago
2008
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
234
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...