Sciweavers

874 search results - page 138 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
EDBT
2009
ACM
122views Database» more  EDBT 2009»
14 years 19 days ago
Finding the influence set through skylines
Given a set P of products, a set O of customers, and a product p P, a bichromatic reverse skyline query retrieves all the customers in O that do not find any other product in P t...
Xiaobing Wu, Yufei Tao, Raymond Chi-Wing Wong, Lin...
NGC
2000
Springer
114views Communications» more  NGC 2000»
14 years 10 days ago
FLID-DL
Abstract--We describe fair layered increase/decrease with dynamic layering (FLID-DL): a new multirate congestion control algorithm for layered multicast sessions. FLID-DL generaliz...
John W. Byers, Michael Frumin, Gavin B. Horn, Mich...
CF
2008
ACM
13 years 10 months ago
A distributed evolutionary method to design scheduling policies for volunteer computing
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
Trilce Estrada, Olac Fuentes, Michela Taufer
BMCBI
2008
214views more  BMCBI 2008»
13 years 9 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 1 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu