Sciweavers

14078 search results - page 416 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
15 years 8 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
GECCO
2008
Springer
177views Optimization» more  GECCO 2008»
15 years 8 months ago
Reduced computation for evolutionary optimization in noisy environment
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
Maumita Bhattacharya
DCOSS
2007
Springer
15 years 10 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
TPDS
2002
198views more  TPDS 2002»
15 years 6 months ago
Orthogonal Striping and Mirroring in Distributed RAID for I/O-Centric Cluster Computing
This paper presents a new distributed disk-array architecture for achieving high I/O performance in scalable cluster computing. In a serverless cluster of computers, all distribute...
Kai Hwang, Hai Jin, Roy S. C. Ho
CAIP
2011
Springer
248views Image Analysis» more  CAIP 2011»
14 years 6 months ago
Statistical Tuning of Adaptive-Weight Depth Map Algorithm
Abstract. In depth map generation, the settings of the algorithm parameters to yield an accurate disparity estimation are usually chosen empirically or based on unplanned experimen...
Alejandro Hoyos, John Congote, Iñigo Barand...