30 search results - page 1 / 6 » A Fast General Methodology for Information - Theoretically O... |
WWW
2004
ACM
14 years 5 months ago
2004
ACM
This paper provides an objective evaluation of the performance impacts of binary XML encodings, using a fast stream-based XQuery processor as our representative application. Inste...
CEC
2007
IEEE
13 years 10 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
ICC
2007
IEEE
13 years 10 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
CIKM
2007
Springer
13 years 8 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
ICCAD
1999
IEEE
13 years 8 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...