Sciweavers

958 search results - page 38 / 192
» The Time Index: An Access Structure for Temporal Data
Sort
View
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
14 years 2 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
ESORICS
2009
Springer
14 years 9 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
ASPLOS
2010
ACM
13 years 11 months ago
Micro-pages: increasing DRAM efficiency with locality-aware data placement
Power consumption and DRAM latencies are serious concerns in modern chip-multiprocessor (CMP or multi-core) based compute systems. The management of the DRAM row buffer can signif...
Kshitij Sudan, Niladrish Chatterjee, David Nellans...
SP
2008
IEEE
159views Security Privacy» more  SP 2008»
13 years 8 months ago
Inferring neuronal network connectivity from spike data: A temporal data mining approach
Abstract. Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent developments in electrophysiology an...
Debprakash Patnaik, P. S. Sastry, K. P. Unnikrishn...
VLDB
1998
ACM
87views Database» more  VLDB 1998»
14 years 21 days ago
Fast High-Dimensional Data Search in Incomplete Databases
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
Beng Chin Ooi, Cheng Hian Goh, Kian-Lee Tan