Sciweavers

3 search results - page 1 / 1
» Succinct Dictionary Matching with No Slowdown
Sort
View
CPM
2010
Springer
124views Combinatorics» more  CPM 2010»
15 years 5 months ago
Succinct Dictionary Matching with No Slowdown
Djamal Belazzougui
148
Voted
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 6 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
ECCV
2010
Springer
14 years 10 months ago
Discriminative Nonorthogonal Binary Subspace Tracking
Visual tracking is one of the central problems in computer vision. A crucial problem of tracking is how to represent the object. Traditional appearance-based trackers are using inc...
Ang Li, Feng Tang, Yanwen Guo, Hai Tao