Sciweavers

202 search results - page 12 / 41
» A more efficient approximation scheme for tree alignment
Sort
View
VLDB
1992
ACM
111views Database» more  VLDB 1992»
13 years 11 months ago
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
In this paper, we explore the execution of pipelined hash joins in a multiprocessor-based database system. To improve the query execution, an innovative approach on query executio...
Ming-Syan Chen, Ming-Ling Lo, Philip S. Yu, Honest...
CADE
2008
Springer
14 years 8 months ago
Certifying a Tree Automata Completion Checker
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
Benoît Boyer, Thomas Genet, Thomas P. Jensen
ASIACRYPT
2007
Springer
13 years 11 months ago
On Efficient Message Authentication Via Block Cipher Design Techniques
In an effort to design a MAC scheme that is built using block cipher components and runs faster than the modes of operation for message authentication, Daemen and Rijmen have propo...
Goce Jakimoski, K. P. Subbalakshmi
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
14 years 7 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
DAC
2009
ACM
14 years 8 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...