12519 search results - page 358 / 2504 » Approximation Problems Categories |
189
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
Web pages contain a combination of unique content and template material, which is present across multiple pages and used primarily for formatting, navigation, and branding. We stu...
149
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
173
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
182
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
160
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...