Sciweavers

1415 search results - page 279 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 7 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
ICDCS
2009
IEEE
14 years 4 months ago
Pushing the Envelope: Extreme Network Coding on the GPU
While it is well known that network coding achieves optimal flow rates in multicast sessions, its potential for practical use has remained to be a question, due to its high compu...
Hassan Shojania, Baochun Li
SC
2003
ACM
14 years 26 days ago
Identifying and Exploiting Spatial Regularity in Data Memory References
The growing processor/memory performance gap causes the performance of many codes to be limited by memory accesses. If known to exist in an application, strided memory accesses fo...
Tushar Mohan, Bronis R. de Supinski, Sally A. McKe...
NAR
2008
175views more  NAR 2008»
13 years 7 months ago
Onto-CC: a web server for identifying Gene Ontology conceptual clusters
The Gene Ontology (GO) vocabulary has been extensively explored to analyze the functions of coexpressed genes. However, despite its extended use in Biology and Medical Sciences, t...
Rocío Romero-Záliz, Coral del Val, J...
TOG
2002
156views more  TOG 2002»
13 years 7 months ago
Chromium: a stream-processing framework for interactive rendering on clusters
We describe Chromium, a system for manipulating streams of graphics API commands on clusters of workstations. Chromium's stream filters can be arranged to create sort-first a...
Greg Humphreys, Mike Houston, Ren Ng, Randall Fran...