Sciweavers

308 search results - page 33 / 62
» Fast Comparisons of Circuit Implementations
Sort
View
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
15 years 12 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
NIPS
2008
15 years 1 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
BMCBI
2010
126views more  BMCBI 2010»
14 years 12 months ago
Cgaln: fast and space-efficient whole-genome alignment
Background: Whole-genome sequence alignment is an essential process for extracting valuable information about the functions, evolution, and peculiarities of genomes under investig...
Ryuichiro Nakato, Osamu Gotoh
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
15 years 8 months ago
Fast and robust quadratic placement combined with an exact linear net model
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
Peter Spindler, Frank M. Johannes
ISPASS
2009
IEEE
15 years 6 months ago
WARP: Enabling fast CPU scheduler development and evaluation
Abstract—Developing CPU scheduling algorithms and understanding their impact in practice can be difficult and time consuming due to the need to modify and test operating system ...
Haoqiang Zheng, Jason Nieh