1114 search results - page 218 / 223 » Optimizing XML Compression |
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}ā...
ESTIMEDIA
2007
Springer
14 years 1 months ago
2007
Springer
āModern compression standards such as H.264, DivX, or VC-1 provide astonishing quality at the costs of steadily increasing processing requirements. Therefore, efļ¬cient solution...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
ā We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a ļ¬eld, with the objective of computing...