Sciweavers

906 search results - page 116 / 182
» Matching Subsequences in Trees
Sort
View
ICDE
2010
IEEE
750views Database» more  ICDE 2010»
14 years 1 months ago
Efficient and accurate discovery of patterns in sequence datasets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
Avrilia Floratou, Sandeep Tata, Jignesh M. Patel
AMAST
1998
Springer
14 years 1 months ago
Scheduling Algebra
The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...
Rob J. van Glabbeek, Peter Rittgen
NIPS
2004
13 years 10 months ago
Proximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Miguel Á. Carreira-Perpiñán, ...
JMLR
2008
148views more  JMLR 2008»
13 years 9 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
ECCC
2007
180views more  ECCC 2007»
13 years 9 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri