807 search results - page 66 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
190
click to vote
JMLR
2008
15 years 6 months ago
2008
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...
148
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
190
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
151
click to vote
SAC
2004
ACM
16 years 4 days ago
2004
ACM
In this work we propose a parallel algorithm for the efficient extraction of binding-site consensus from genomic sequences. This algorithm, based on an existing approach, extracts...
189
click to vote
ICTAI
2000
IEEE
15 years 10 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...