Sciweavers

615 search results - page 41 / 123
» fast 2003
Sort
View
SC
2003
ACM
15 years 8 months ago
Fast Parallel Non-Contiguous File Access
Many applications of parallel I/O perform non-contiguous file accesses: instead of accessing a single (large) block of data in a file, a number of (smaller) blocks of data scatt...
Joachim Worringen, Jesper Larsson Träff, Hube...
ICICS
2003
Springer
15 years 8 months ago
Secure Route Structures for the Fast Dispatch of Large-Scale Mobile Agents
Abstract. For the application of large-scale mobile agents in a distributed environment, where a large number of computers are connected together to enable the large-scale sharing ...
Yan Wang 0002, Chi-Hung Chi, Tieyan Li
123
Voted
DICTA
2003
15 years 4 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 4 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
WORM
2003
15 years 4 months ago
Experiences with worm propagation simulations
Fast Internet worms are a relatively new threat to Internet infrastructure and hosts. We discuss motivation and possibilities to study the behaviour of such worms and degrees of f...
Arno Wagner, Thomas Dübendorfer, Bernhard Pla...