1091 search results - page 60 / 219 » Approximation in Databases |
AI
2008
Springer
14 years 12 months ago
2008
Springer
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
137
click to vote
JIIS
2002
14 years 11 months ago
2002
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
216
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
190
click to vote
ICDE
1999
IEEE
16 years 1 months ago
1999
IEEE
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
117
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
Many web databases can be seen as providing partial and overlapping information about entities in the world. To answer queries effectively, we need to integrate the information abo...