Sciweavers

673 search results - page 57 / 135
» Querying Continuous Time Sequences
Sort
View
SI3D
2005
ACM
15 years 6 months ago
Towards space: time light field rendering
So far extending light field rendering to dynamic scenes has been trivially treated as the rendering of static light fields stacked in time. This type of approaches requires inp...
Huamin Wang, Ruigang Yang
ICES
2003
Springer
125views Hardware» more  ICES 2003»
15 years 5 months ago
Evolving Reinforcement Learning-Like Abilities for Robots
Abstract. In [8] Yamauchi and Beer explored the abilities of continuous time recurrent neural networks (CTRNNs) to display reinforcementlearning like abilities. The investigated ta...
Jesper Blynel
118
Voted
SSD
2001
Springer
112views Database» more  SSD 2001»
15 years 5 months ago
K-Nearest Neighbor Search for Moving Query Point
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
Zhexuan Song, Nick Roussopoulos
74
Voted
APBC
2004
15 years 1 months ago
Variable-length Intervals in Homology Search
Fast, accurate, and scalable search techniques for homology searching of large genomic collections are becoming an increasingly important requirement as genomic sequence collectio...
Abhijit Chattaraj, Hugh E. Williams
156
Voted
BMCBI
2011
14 years 4 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