820 search results - page 17 / 164 » Finding low-utility data structures |
ESA
1998
Springer
14 years 26 days ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
RECOMB
2003
Springer
14 years 9 months ago
2003
Springer
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
SADFE
2008
IEEE
14 years 3 months ago
2008
IEEE
Secure logs are powerful tools for building systems that must resist forgery, prove temporal relationships, and stand up to forensic scrutiny. The proofs of order and integrity en...
JCDL
2005
ACM
14 years 2 months ago
2005
ACM
One of the criticisms library users often make of catalogs is that they rarely include information below the bibliographic level. It is generally impossible to search a catalog fo...
ML
2007
ACM
13 years 8 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...