3686 search results - page 467 / 738 » Comprehensive comprehensions |
152
click to vote
CONEXT
2007
ACM
15 years 8 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
141
click to vote
DASFAA
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
104
click to vote
CAV
2010
Springer
15 years 8 months ago
2010
Springer
d Abstract) Benedikt Bollig1 , Joost-Pieter Katoen2 , Carsten Kern2 , Martin Leucker3 , Daniel Neider2 , and David R. Piegdon2 1 LSV, ENS Cachan, CNRS, 2 RWTH Aachen University, 3 ...
112
click to vote
CSFW
2010
IEEE
15 years 8 months ago
2010
IEEE
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
159
click to vote
DEBS
2010
ACM
15 years 8 months ago
2010
ACM
Publish/subscribe systems are used increasingly often as a communication mechanism in loosely-coupled distributed applications. With their gradual adoption in mission critical are...