Sciweavers

9209 search results - page 374 / 1842
» Data Space Randomization
Sort
View
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 8 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
SC
2000
ACM
15 years 11 months ago
Data Access Performance in a Large and Dynamic Pharmaceutical Drug Candidate Database
An explosion in the amount of data generated through chemical and biological experimentation has been observed in recent years. This rapid proliferation of vast amounts of data ha...
Zina Ben-Miled, Yang Liu, David Powers, Omran A. B...
SPAA
2009
ACM
16 years 7 months ago
A DoS-resilient information system for dynamic data management
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
Matthias Baumgart, Christian Scheideler, Stefan Sc...
AUSAI
2009
Springer
15 years 10 months ago
Ensemble Approach for the Classification of Imbalanced Data
Ensembles are often capable of greater prediction accuracy than any of their individual members. As a consequence of the diversity between individual base-learners, an ensemble wil...
Vladimir Nikulin, Geoffrey J. McLachlan, Shu-Kay N...
TMI
2002
113views more  TMI 2002»
15 years 6 months ago
Spatiotemporal reconstruction of list mode PET data
We describe a method for computing a continuous time estimate of tracer density using list-mode positron emission tomography data. The rate function in each voxel is modeled as an ...
Thomas E. Nichols, Jinyi Qi, Evren Asma, Richard M...