Sciweavers

70 search results - page 8 / 14
» Rapidly Exploring Application Design Through Speed Dating
Sort
View
IJES
2008
130views more  IJES 2008»
14 years 11 months ago
Deriving efficient control in Process Networks with Compaan/Laura
: At Leiden Embedded Research Center (LERC), we are building a tool chain called Compaan/Laura that allows us to map rapidly and efficiently signal processing applications written ...
Steven Derrien, Alexandru Turjan, Claudiu Zissules...
BMCBI
2011
14 years 3 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
KDD
2002
ACM
193views Data Mining» more  KDD 2002»
16 years 1 days ago
Query, analysis, and visualization of hierarchically structured data using Polaris
In the last several years, large OLAP databases have become common in a variety of applications such as corporate data warehouses and scientific computing. To support interactive ...
Chris Stolte, Diane Tang, Pat Hanrahan
VRST
2006
ACM
15 years 5 months ago
A reprocessing tool for quantitative data analysis in a virtual environment
This paper presents an approach to help speed up and unify the exploration and analysis of time-dependent, volumetric data sets by easily incorporating new qualitative and quantit...
Eric J. Griffith, Michal Koutek, Frits H. Post, T....
CHI
1999
ACM
15 years 4 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.