110 search results - page 1 / 22 » Forest trees for on-line data |
DAGM
2010
Springer
13 years 6 months ago
2010
Springer
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...
ICPR
2010
IEEE
13 years 10 months ago
2010
IEEE
—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...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
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 ...
WEBDB
2001
Springer
13 years 9 months ago
2001
Springer
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...
SODA
1990
ACM
13 years 6 months ago
1990
ACM
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...