1089 search results - page 201 / 218 » Bounds on generalized Frobenius numbers |
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
In the implementation of hosted business services, multiple tenants are often consolidated into the same database to reduce total cost of ownership. Common practice is to map mult...
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...