Sciweavers

16091 search results - page 3207 / 3219
» Solving
Sort
View
SIGMOD
2012
ACM
288views Database» more  SIGMOD 2012»
11 years 10 months ago
Exploiting MapReduce-based similarity joins
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Sim...
Yasin N. Silva, Jason M. Reed
SIGMOD
2012
ACM
224views Database» more  SIGMOD 2012»
11 years 10 months ago
Tiresias: the database oracle for how-to queries
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
Alexandra Meliou, Dan Suciu
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
11 years 10 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
11 years 10 months ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng
INFOCOM
2012
IEEE
11 years 10 months ago
Fair background data transfers of minimal delay impact
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
Costas Courcoubetis, Antonis Dimakis
« Prev « First page 3207 / 3219 Last » Next »