400 search results - page 51 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
109
click to vote
KDD
2007
ACM
16 years 6 days ago
2007
ACM
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
107
click to vote
ICPP
2002
IEEE
15 years 4 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
ASPLOS
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we present our effort in developing an opensource GPU (graphics processing units) code library for the MATLAB Image Processing Toolbox (IPT). We ported a dozen of r...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
104
click to vote
CCO
2001
Springer
15 years 4 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...