2157 search results - page 225 / 432 » Optimal Fast Hashing |
105
Voted
VLDB
2004
ACM
15 years 8 months ago
2004
ACM
Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports b...
145
Voted
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
142
Voted
CPM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
154
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
139
click to vote
RFIDSEC
2010
15 years 1 months ago
2010
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...