Sciweavers

473 search results - page 16 / 95
» Heapable Sequences and Subsequences
Sort
View
SGAI
2010
Springer
14 years 8 months ago
Hierarchical Traces for Reduced NSM Memory Requirements
This paper presents work on using hierarchical long term memory to reduce the memory requirements of nearest sequence memory (NSM) learning, a previously published, instance-based ...
Torbjørn S. Dahl
CIARP
2009
Springer
15 years 4 months ago
Learning Relational Grammars from Sequences of Actions
Many tasks can be described by sequences of actions that normally exhibit some form of structure and that can be represented by a grammar. This paper introduces FOSeq, an algorithm...
Blanca Vargas-Govea, Eduardo F. Morales
79
Voted
CJ
2008
90views more  CJ 2008»
14 years 10 months ago
Parameterized Complexity and Biopolymer Sequence Comparison
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...
Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances A....
ICDE
2003
IEEE
149views Database» more  ICDE 2003»
15 years 11 months ago
Indexing Weighted-Sequences in Large Databases
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...
Haixun Wang, Chang-Shing Perng, Wei Fan, Sanghyun ...
84
Voted
ISBI
2006
IEEE
15 years 4 months ago
Automated detection of stable fracture points in computed tomography image sequences
Automated detection of stable fracture points in a sequence of Computed Tomography (CT) images is found to be a challenging task. In this paper, an innovative scheme for automatic...
Ananda S. Chowdhury, Suchendra M. Bhandarkar, Gaur...