Sciweavers

22358 search results - page 4344 / 4472
» Software Performance Engineering
Sort
View
124
Voted
PODC
2009
ACM
16 years 3 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
16 years 3 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
120
Voted
KDD
2002
ACM
175views Data Mining» more  KDD 2002»
16 years 2 months ago
Mining product reputations on the Web
Knowing the reputations of your own and/or competitors' products is important for marketing and customer relationship management. It is, however, very costly to collect and a...
Satoshi Morinaga, Kenji Yamanishi, Kenji Tateishi,...
138
Voted
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
16 years 2 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
205
Voted
VLDB
2004
ACM
161views Database» more  VLDB 2004»
16 years 2 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
« Prev « First page 4344 / 4472 Last » Next »