1314 search results - page 245 / 263 » Approximate data mining in very large relational data |
106
click to vote
EDBT
2008
ACM
16 years 1 months ago
2008
ACM
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
127
click to vote
VMV
2004
15 years 2 months ago
2004
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
138
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
118
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
In many real-world classification problems the input contains a large number of potentially irrelevant features. This paper proposes a new Bayesian framework for determining the r...