Sciweavers

996 search results - page 73 / 200
» A general method to speed up fixed-parameter-tractable algor...
Sort
View
VRST
2006
ACM
16 years 19 days 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....
GIS
2006
ACM
16 years 7 months ago
Distance join queries on spatial networks
The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object ...
Jagan Sankaranarayanan, Houman Alborzi, Hanan Same...
169
Voted
GECCO
2006
Springer
129views Optimization» more  GECCO 2006»
15 years 10 months ago
Revisiting evolutionary algorithms with on-the-fly population size adjustment
In an evolutionary algorithm, the population has a very important role as its size has direct implications regarding solution quality, speed, and reliability. Theoretical studies ...
Fernando G. Lobo, Cláudio F. Lima
CASES
2005
ACM
15 years 8 months ago
Exploiting pipelining to relax register-file port constraints of instruction-set extensions
Customisable embedded processors are becoming available on the market, thus making it possible for designers to speed up execution of applications by using Application-specific F...
Laura Pozzi, Paolo Ienne
BMCBI
2011
14 years 10 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