Abstract. A successful approach to tracking is to on-line learn discriminative classifiers for the target objects. Although these trackingby-detection approaches are usually fast a...
Christian Leistner, Martin Godec, Amir Saffari, Ho...
—Randomized learning methods (i.e., Forests or Ferns) have shown excellent capabilities for various computer vision applications. However, it was shown that the tree structure in...
Martin Godec, Christian Leistner, Amir Saffari, Ho...
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
For speed and convenience, applications routinely cache XML data locally, and access it through standard parser (SAX) or tree (DOM) interfaces. When the source of this data is a r...
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...