Sciweavers

8431 search results - page 361 / 1687
» Algorithmically Independent Sequences
Sort
View
PPAM
2007
Springer
16 years 28 days ago
On Parallel Generation of Partial Derangements, Derangements and Permutations
The concept of a partial derangement is introduced and a versatile representation of partial derangements is proposed with permutations and derangements as special cases. The repre...
Zbigniew Kokosinski
LPAR
2005
Springer
16 years 9 days ago
Matching with Regular Constraints
We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. C...
Temur Kutsia, Mircea Marin
DM
2006
84views more  DM 2006»
15 years 6 months ago
Indefinite summation with unspecified summands
We provide a new algorithm for indefinite nested summation which is applicable to summands involving unspecified sequences x(n). More than that, we show how to extend Karr's ...
Manuel Kauers, Carsten Schneider
ICDM
2009
IEEE
97views Data Mining» more  ICDM 2009»
16 years 1 months ago
Hierarchical Probabilistic Segmentation of Discrete Events
—Segmentation, the task of splitting a long sequence of discrete symbols into chunks, can provide important information about the nature of the sequence that is understandable to...
Guy Shani, Christopher Meek, Asela Gunawardana
SC
2003
ACM
16 years 1 days ago
A Million-Fold Speed Improvement in Genomic Repeats Detection
This paper presents a novel, parallel algorithm for generating top alignments. Top alignments are used for finding internal repeats in biological sequences like proteins and gene...
John W. Romein, Jaap Heringa, Henri E. Bal