Sciweavers

273 search results - page 36 / 55
» Compressed String Dictionaries
Sort
View
SPIRE
2001
Springer
15 years 4 months ago
Speed-up of Aho-Corasick Pattern Matching Machines by Rearranging States
Thispaper describes speed-up of string pattern matchingby rearrangingstates inAho-Corasickpattern matching machine, which is a kind of afinite automaton. Werealized speed-up of st...
T. Nishimura, Shuichi Fukamachi, Takeshi Shinohara
FPGA
2007
ACM
150views FPGA» more  FPGA 2007»
15 years 6 months ago
FPGA-friendly code compression for horizontal microcoded custom IPs
Shrinking time-to-market and high demand for productivity has driven traditional hardware designers to use design methodologies that start from high-level languages. However, meet...
Bita Gorjiara, Daniel Gajski
87
Voted
DCC
2008
IEEE
15 years 11 months ago
Compression of Hyperspectral Images with LVQ-SPECK
We discuss the use of lattice vector quantizers in conjunction with a quadtree-based sorting algorithm for the compression of multidimensional data sets, as encountered, for examp...
Alessandro J. S. Dutra, William A. Pearlman, Eduar...
IJFCS
2006
108views more  IJFCS 2006»
14 years 12 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
CEC
2007
IEEE
15 years 6 months ago
A fractal representation for real optimization
— The chaos game, in which a moving point is repeatedly averaged toward randomly selected vertices of a triangle, is one method of generating the fractal called the Sierpinski tr...
Daniel A. Ashlock, Justin Schonfeld