资 源 简 介
Nowadays search algorithms on huge data sets attract much attention.
One of key approaches of such algorithms is to compute compressed
representation of input data. So every search query executes on
compressed representation that reduce size of input.
Various compressed representations of strings are known:
straight-line programs (SLPs), collage-systems, string representations using antidictionaries, etc. Nowadays text compression based on context-free
grammars such as SLPs is very popular. The reason for this is not
only that grammars provide well-structured compression but also that
the SLP-based compression is in a sense polynomially equivalent to
the compression achieved by the Lempel-Ziv algorithm that is widely
used in practice. It means that, given a text S, there is a polynomial
relation between the size of an SLP that derives S and the size of
the dictionary stored by the Lempe
文 件 列 表
COPYING
documentation
cheatsheets
commands
files
images
manual
home.textile
framework
.DS_Store
build.xml
classes
dependencies.yml
lib
lib-test
patches
play-master-aeec838.jar
pym
src
templates
test-src
modules
console
crud
docviewer
grizzly
secure
testrunner
nbproject
project.xml
play
play.bat
python
DLLs
easy_install.py
Lib
LICENSE.txt
Microsoft.VC90.CRT.manifest
msvcm90.dll
msvcp90.dll
msvcr71.dll
msvcr90.dll
pkg_resources.py
python.exe
python.exe.manifest
python26.dll
site.py
unicows.dll
README.textile
resources
_nbproject
application-build.xml
application-skel
eclipse
idea
messages
module-skel
war
samples-and-tests
.gitignore
booking
chat
facebook-oauth2
forum
i-am-a-developer
jobboard
just-test-cases
twitter-oauth
validation
yabe
zencontact
support
eclipse
play_completion
textmate.zip
vim
zsh
