1091 search results - page 66 / 219 » Approximation in Databases |
201
click to vote
ASUNAM
2011
IEEE
13 years 12 months ago
2011
IEEE
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
190
click to vote
ICDT
2009
ACM
16 years 17 days ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
ICDT
2010
ACM
15 years 4 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
122
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
127
click to vote
FAW
2010
Springer
15 years 1 days ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...