Sciweavers

346 search results - page 28 / 70
» Towards Declarative Queries on Adaptive Data Structures
Sort
View
ESORICS
2009
Springer
14 years 8 months ago
Data Structures with Unpredictable Timing
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
Darrell Bethea, Michael K. Reiter
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 9 months ago
Adaptive Segmentation for Scientific Databases
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
Milena Ivanova, Martin L. Kersten, Niels Nes
COLCOM
2008
IEEE
13 years 9 months ago
Towards Continuous Workflow Enactment Systems
Abstract. Traditional workflow enactment systems and workflow design processes view the workflow as a one-time interaction with the various data sources, executing a series of step...
Panayiotis Neophytou, Panos K. Chrysanthis, Alexan...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 8 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
DAWAK
2001
Springer
14 years 1 days ago
Adaptable Similarity Search Using Vector Quantization
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...