Sciweavers

1095 search results - page 115 / 219
» Preprocessing of Intractable Problems
Sort
View
CIKM
1998
Springer
14 years 2 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
IJIT
2004
13 years 11 months ago
Evaluation of Algorithms for Sequential Decision in Biosonar Target Classification
A sequential decision problem, based on the task of identifying the species of trees given acoustic echo data collected from them, is considered with well-known stochastic classifi...
Turgay Temel, John Hallam
VIIP
2001
13 years 11 months ago
Salient Frame Extraction for Structure from Motion
We propose a key frame extraction mechanism to aid the Structure from Motion (SfM) problem when dealing with image sequences from video cameras. Due to high frame rates (15 frames...
Anthony Whitehead, Gerhard Roth
NIPS
2003
13 years 11 months ago
Warped Gaussian Processes
We generalise the Gaussian process (GP) framework for regression by learning a nonlinear transformation of the GP outputs. This allows for non-Gaussian processes and non-Gaussian ...
Edward Snelson, Carl Edward Rasmussen, Zoubin Ghah...
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 10 months ago
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
Venkatesan Guruswami, Alexander Vardy