Sciweavers

9736 search results - page 60 / 1948
» How Fast Can We Compute Products
Sort
View
111
Voted
HPDC
2010
IEEE
15 years 5 months ago
Fast and scalable simulation of volunteer computing systems using SimGrid
Advances in internetworking technology and the decreasing cost-performance ratio of commodity computing components have enabled Volunteer Computing (VC). VC platforms aggregate te...
Bruno Donassolo, Henri Casanova, Arnaud Legrand, P...
FPGA
2003
ACM
116views FPGA» more  FPGA 2003»
15 years 9 months ago
Hardware-assisted simulated annealing with application for fast FPGA placement
To truly exploit FPGAs for rapid turn-around development and prototyping, placement times must be reduced to seconds; latebound, reconfigurable computing applications may demand p...
Michael G. Wrighton, André DeHon
134
Voted
BMCBI
2005
116views more  BMCBI 2005»
15 years 4 months ago
Can Zipf's law be adapted to normalize microarrays?
Background: Normalization is the process of removing non-biological sources of variation between array experiments. Recent investigations of data in gene expression databases for ...
Timothy Lu, Christine M. Costello, Peter J. P. Cro...
ICIP
2008
IEEE
15 years 11 months ago
A fast level set algorithm for shape-based segmentation with multiple selective priors
This paper addresses the shape-based segmentation problem using level sets. In particular, we propose a fast algorithm to solve the piece-wise constant Chan-Vese segmentation mode...
Rachid Fahmi, Aly A. Farag
POPL
2009
ACM
16 years 5 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...