71 search results - page 6 / 15 » Compressing Large Signature Trees |
ISSAC
1994
Springer
14 years 16 days ago
1994
Springer
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
Prominent feature point descriptors such as SIFT and
SURF allow reliable real-time matching but at a compu-
tational cost that limits the number of points that can be
handled on...
DCC
2010
IEEE
14 years 3 months ago
2010
IEEE
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
HPDC
2006
IEEE
14 years 2 months ago
2006
IEEE
Trace-driven simulation is an important technique used in the evaluation of computer architecture innovations. However using it for studying parallel computers and applications is...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...