12783 search results - page 544 / 2557 » Experimenting with computing |
222
click to vote
SAC
2011
ACM
14 years 9 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
208
click to vote
TOG
2012
13 years 9 months ago
2012
Compositing is one of the most commonly performed operations in computer graphics. A realistic composite requires adjusting the appearance of the foreground and background so that...
162
click to vote
RECOMB
2008
Springer
16 years 7 months ago
2008
Springer
Protein interactions and complexes are major components of biological systems. Recent genome-wide applications of tandem affinity purification (TAP) in yeast have increased signifi...
164
click to vote
HPDC
2006
IEEE
16 years 1 months ago
2006
IEEE
Most parallel computing resources are controlled by batch schedulers that place requests for computation in a queue until access to compute nodes is granted. Queue waiting times a...
240
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This paper introduces a new framework for image classification using local visual descriptors. The pipeline first performs a nonlinear feature transformation on descripto...