15485 search results - page 3040 / 3097 » Computing Optimal Subsets |
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
ICS
2010
Tsinghua U.
15 years 2 months ago
2010
Tsinghua U.
A GPU cluster is a cluster equipped with GPU devices. Excellent acceleration is achievable for computation-intensive tasks (e.g. matrix multiplication and LINPACK) and bandwidth-i...
100
click to vote
COMPSAC
2009
IEEE
15 years 2 months ago
2009
IEEE
Matrices are essential in many fields of computer science, especially when large amounts of data must be handled efficiently. Despite this demand for matrix software, we were una...
MSWIM
2009
ACM
15 years 2 months ago
2009
ACM
Cognitive Radio (CR) technology constitutes a new paradigm to provide additional spectrum utilization opportunities in wireless ad hoc networks. Recent research in this field has ...