2626 search results - page 94 / 526 » The complexity of stochastic sequences |
DAC
1997
ACM
15 years 4 months ago
1997
ACM
- This paper presents an effective technique for compacting a large sequence of input vectors into a much smaller one such that when the two sequences are applied to any circuit, t...
FGR
2004
IEEE
15 years 3 months ago
2004
IEEE
Complex human motion (e.g. dance) sequences are typically analyzed by segmenting them into shorter motion sequences, called gestures. However, this segmentation process is subject...
100
click to vote
PODS
2001
ACM
16 years 1 days ago
2001
ACM
The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we discuss how to express and support efficiently sophis...
160
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
199
click to vote
ICLP
2009
Springer
16 years 16 days ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...