Sciweavers

4004 search results - page 795 / 801
» How Many Packets Can We Encode
Sort
View
CHI
1999
ACM
15 years 6 months ago
A Better Mythology for System Design
The past decades have seen huge improvements in computer systems but these have proved difficult to translate into comparable improvements in the usability and social integration)...
Jed Harris, D. Austin Henderson Jr.
BMCBI
2007
233views more  BMCBI 2007»
15 years 2 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
BMCBI
2006
100views more  BMCBI 2006»
15 years 2 months ago
DNPTrapper: an assembly editing tool for finishing and analysis of complex repeat regions
Background: Many genome projects are left unfinished due to complex, repeated regions. Finishing is the most time consuming step in sequencing and current finishing tools are not ...
Erik Arner, Martti T. Tammi, Anh-Nhi Tran, Ellen K...
WWW
2004
ACM
16 years 3 months ago
C3W: clipping, connecting and cloning for the web
Many of today's Web applications support just simple trial-anderror retrievals: supply one set of parameters, obtain one set of results. For a user who wants to examine a num...
Aran Lunzer, Jun Fujima, Kasper Hornbæk, Yuz...
PADL
2009
Springer
16 years 3 months ago
Declarative Programming of User Interfaces
This paper proposes a declarative description of user interfaces that s from low-level implementation details. In particular, the user interfaces specified in our framework are exe...
Christof Kluß, Michael Hanus