Sciweavers

317 search results - page 57 / 64
» Computing and Updating the Process Number in Trees
Sort
View
SASP
2009
IEEE
291views Hardware» more  SASP 2009»
14 years 3 months ago
A parameterisable and scalable Smith-Waterman algorithm implementation on CUDA-compatible GPUs
—This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) algorithm on compute unified device architecture (CUDA)-compatible graphic pr...
Cheng Ling, Khaled Benkrid, Tsuyoshi Hamada
EDBT
2000
ACM
14 years 1 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
NAACL
2003
13 years 10 months ago
Automatic Acquisition of Names Using Speak and Spell Mode in Spoken Dialogue Systems
This paper describes a novel multi-stage recognition procedure for deducing the spelling and pronunciation of an open set of names. The overall goal is the automatic acquisition o...
Grace Chung, Stephanie Seneff, Chao Wang
TALG
2008
131views more  TALG 2008»
13 years 8 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
ICML
2005
IEEE
14 years 9 months ago
Combining model-based and instance-based learning for first order regression
T ORDER REGRESSION (EXTENDED ABSTRACT) Kurt Driessensa Saso Dzeroskib a Department of Computer Science, University of Waikato, Hamilton, New Zealand (kurtd@waikato.ac.nz) b Departm...
Kurt Driessens, Saso Dzeroski