Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Walter Cai"'
Many applications need to clean data with a target accuracy. As far as we know, this problem has not been studied in depth. In this paper we take the first step toward solving it. We focus on value normalization (VN), the problem of replacing all str
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af52f42def414d59fe42bdd1d8238625
http://arxiv.org/abs/2101.05308
http://arxiv.org/abs/2101.05308
We design, implement, and evaluate DeepEverest, a system for the efficient execution of interpretation by example queries over the activation values of a deep neural network. DeepEverest consists of an efficient indexing technique and a query executi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5837cbb3c3c576bb8db897a43ba36d9c
Publikováno v:
SIGMOD Conference
In this work we introduce a novel approach to the problem of cardinality estimation over multijoin queries. Our approach leveraging randomized hashing and data sketching to tighten these bounds beyond the current state of the art. We demonstrate that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d2075c11a307469dffa50028fc8b4fb
https://doi.org/10.1145/3299869.3319894
https://doi.org/10.1145/3299869.3319894
Autor:
Walter Cai
Publikováno v:
SIGMOD Conference
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc2f589e4f0bf2a00724233c2d35e364
https://doi.org/10.1145/3183713.3183714
https://doi.org/10.1145/3183713.3183714
Publikováno v:
CIKM
We introduce and theoretically study the Gardener's problem that well models many web information monitoring scenarios, where numerous dynamically changing web sources are monitored and local information needs to be periodically updated under communi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9212418a3544fc5be74ff95fb56498dc
https://doi.org/10.1145/1645953.1646162
https://doi.org/10.1145/1645953.1646162