327 search results - page 52 / 66 » Algorithms for infinite huffman-codes |
188
click to vote
PODS
2009
ACM
16 years 28 days ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
172
Voted
POPL
2003
ACM
16 years 21 days ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
194
Voted
SIGMOD
2008
ACM
16 years 16 days ago
2008
ACM
A statistical database (StatDB) retrieves only aggregate results, as opposed to individual tuples. This paper investigates the construction of a privacy preserving StatDB that can...
91
Voted
DCC
2007
IEEE
15 years 12 months ago
2007
IEEE
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...
210
Voted
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...