Sciweavers

202 search results - page 14 / 41
» Dynamic and Redundant Data Placement
Sort
View
TMC
2002
118views more  TMC 2002»
13 years 7 months ago
Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management
The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two importan...
Yu-Chee Tseng, Chih-Min Chao
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 8 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
MMS
2000
13 years 7 months ago
Failure Recovery Algorithms for Multimedia Servers
In this paper, we present two novel disk failure recovery methods that utilize the inherent characteristics of video streams for efficient recovery. Whereas the first method explo...
Prashant J. Shenoy, Harrick M. Vin
ISHPC
1999
Springer
13 years 11 months ago
Dynamically Adaptive Parallel Programs
Abstract. Dynamic program optimization is the only recourse for optimizing compilers when machine and program parameters necessary for applying an optimization technique are unknow...
Michael Voss, Rudolf Eigenmann
SAINT
2007
IEEE
14 years 1 months ago
Data Management on Grid Filesystem for Data-Intensive Computing
In parallel computing environments such as HPC clusters and the Grid, data-intensive applications involve large overhead costs due to a concentration of access to the files on co...
Hitoshi Sato, Satoshi Matsuoka