Sciweavers

9209 search results - page 424 / 1842
» Data Space Randomization
Sort
View
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
16 years 7 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
P2P
2007
IEEE
16 years 1 months ago
A Data Placement Scheme with Time-Related Model for P2P Storages
Maintaining desired data availability while minimizing costs is the primary challenge in designing P2P storages. Data placement schemes and data availability calculation methods a...
Jing Tian, Zhi Yang, Yafei Dai
ITC
1998
IEEE
94views Hardware» more  ITC 1998»
15 years 11 months ago
A method of serial data jitter analysis using one-shot time interval measurements
A method for measuring inter-symbol interference, duty cycle distortion, random jitter and periodic jitter is described. The Blackman-Tukey method of signal analysis is used. This...
Jan B. Wilstrup
ADHOC
2007
169views more  ADHOC 2007»
15 years 7 months ago
Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems
Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous ...
Daniela Tulone
TMC
2008
210views more  TMC 2008»
15 years 6 months ago
Adaptive Cluster-Based Data Collection in Sensor Networks with Direct Sink Access
Recently wireless sensor networks featuring direct sink access have been studied as an efficient architecture to gather and process data for numerous applications. In this paper, w...
Mahdi Lotfinezhad, Ben Liang, Elvino S. Sousa