Sciweavers

35 search results - page 4 / 7
» How important is a transfer function in discrete heuristic a...
Sort
View
BMCBI
2007
233views more  BMCBI 2007»
13 years 8 months ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong
DELTA
2004
IEEE
14 years 8 days ago
Static Scheduling of Monoprocessor Real-Time Systems composed of Hard and Soft Tasks
In this report we address the problem of static scheduling of realtime systems that include both hard and soft tasks. We consider systems in which both hard and soft tasks are per...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
INFOCOM
2012
IEEE
11 years 11 months ago
On exploiting flow allocation with rate adaptation for green networking
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
Jian Tang, Brendan Mumey, Yun Xing, Andy Johnson
COMPGEOM
2008
ACM
13 years 10 months ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 3 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...