Sciweavers

868 search results - page 17 / 174
» A general compression algorithm that supports fast searching
Sort
View
ASPLOS
2000
ACM
14 years 3 hour ago
Architectural Support for Fast Symmetric-Key Cryptography
The emergence of the Internet as a trusted medium for commerce and communication has made cryptography an essential component of modern information systems. Cryptography provides ...
Jerome Burke, John McDonald, Todd M. Austin
WWW
2005
ACM
14 years 8 months ago
G-ToPSS: fast filtering of graph-based metadata
RDF is increasingly being used to represent metadata. RDF Site Summary (RSS) is an application of RDF on the Web that has considerably grown in popularity. However, the way RSS sy...
Milenko Petrovic, Haifeng Liu, Hans-Arno Jacobsen
TASE
2011
IEEE
12 years 11 months ago
Fast Intersection-Free Offset Surface Generation From Freeform Models With Triangular Meshes
Abstract—A fast offset surface generation approach is presented in this paper to construct intersection-free offset surfaces, which preserve sharp features, from freeform triangu...
Shengjun Liu, Charlie C. L. Wang
PLDI
2004
ACM
14 years 1 months ago
Fast searches for effective optimization phase sequences
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...
CPM
2000
Springer
145views Combinatorics» more  CPM 2000»
13 years 12 months ago
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
Gonzalo Navarro, Jorma Tarhio