Sciweavers

2324 search results - page 304 / 465
» A Fast Keyword-Spotting Technique
Sort
View
CADE
2008
Springer
16 years 6 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
SIGMOD
2004
ACM
157views Database» more  SIGMOD 2004»
16 years 6 months ago
Holistic UDAFs at streaming speeds
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...
Graham Cormode, Theodore Johnson, Flip Korn, S. Mu...
EDBT
2002
ACM
188views Database» more  EDBT 2002»
16 years 6 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis
EDBT
2004
ACM
141views Database» more  EDBT 2004»
16 years 6 months ago
HEAVEN: A Hierarchical Storage and Archive Environment for Multidimensional Array Database Management Systems
Abstract. The intention of this paper is to present HEAVEN, a solution of intelligent management of large-scale datasets held on tertiary storage systems. We introduce the common s...
Bernd Reiner, Karl Hahn
DCC
2006
IEEE
16 years 6 months ago
Data Compression with Restricted Parsings
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
John T. Robinson, Luis Alfonso Lastras-Monta&ntild...