114 search results - page 13 / 23 » The Tree Inclusion Problem: In Linear Space and Faster |
SODA
1998
ACM
14 years 10 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
RECOMB
2002
Springer
15 years 9 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
TIP
2010
14 years 4 months ago
2010
Abstract--Can images be decomposed into the sum of a geometric part and a textural part? In a theoretical breakthrough, [Y. Meyer, Oscillating Patterns in Image Processing and Nonl...
IR
2010
14 years 7 months ago
2010
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...
TKDE
2008
14 years 9 months ago
2008
This paper introduces a new method for supervised discretization based on interval distances by using a novel concept of neighborhood in the target's space. The proposed metho...