Sciweavers

627 search results - page 80 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
15 years 11 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
FAST
2010
15 years 1 months ago
Bimodal Content Defined Chunking for Backup Streams
Data deduplication has become a popular technology for reducing the amount of storage space necessary for backup and archival data. Content defined chunking (CDC) techniques are w...
Erik Kruus, Cristian Ungureanu, Cezary Dubnicki
BMCBI
2006
100views more  BMCBI 2006»
14 years 11 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
ICDCS
2007
IEEE
15 years 5 months ago
Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks
Effective mechanisms for detecting and thwarting Distributed Denial-of-Service (DDoS) attacks are becoming increasingly important to the success of today’s Internet as a viable ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
ISLPED
2010
ACM
169views Hardware» more  ISLPED 2010»
14 years 11 months ago
TurboTag: lookup filtering to reduce coherence directory power
On-chip coherence directories of today's multi-core systems are not energy efficient. Coherence directories dissipate a significant fraction of their power on unnecessary loo...
Pejman Lotfi-Kamran, Michael Ferdman, Daniel Crisa...