Sciweavers

3018 search results - page 441 / 604
» Replicating for Performance: Case Studies
Sort
View
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 6 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
VLDB
2006
ACM
190views Database» more  VLDB 2006»
16 years 6 months ago
Online summarization of dynamic time series data
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
ICSE
2007
IEEE-ACM
16 years 6 months ago
Tracking Code Clones in Evolving Software
Code clones are generally considered harmful in software development, and the predominant approach is to try to eliminate them through refactoring. However, recent research has pr...
Ekwa Duala-Ekoko, Martin P. Robillard
ICSE
2008
IEEE-ACM
16 years 6 months ago
Security metrics for source code structures
Software security metrics are measurements to assess security related imperfections (or perfections) introduced during software development. A number of security metrics have been...
Istehad Chowdhury, Brian Chan, Mohammad Zulkernine
DCC
2006
IEEE
16 years 6 months ago
Adaptive Run-Length / Golomb-Rice Encoding of Quantized Generalized Gaussian Sources with Unknown Statistics
We present a simple and efficient entropy coder that combines run-length and Golomb-Rice encoders. The encoder automatically switches between the two modes according to simple rul...
Henrique S. Malvar