807 search results - page 93 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
175
Voted
CPM
2004
Springer
15 years 9 months ago
2004
Springer
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...
137
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
In order to become an effective complement to traditional Web-scale text-based image retrieval solutions, content-based image retrieval must address scalability and efficiency iss...
129
Voted
TCS
2008
15 years 3 months ago
2008
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
120
Voted
IJRR
2010
15 years 29 days ago
2010
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
137
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...