2740 search results - page 105 / 548 » Approximating Component Selection |
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
PODS
2000
ACM
15 years 2 months ago
2000
ACM
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
NIPS
1998
14 years 11 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
100
click to vote
KSEM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...