Sciweavers

7648 search results - page 70 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
ICPP
1998
IEEE
15 years 2 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
AAAI
1997
14 years 11 months ago
Query Optimization Using Local Completeness
We consider the problem of query plan optimization in information brokers. Information brokers are programs that facilitate access to collections of information sources by hiding ...
Oliver M. Duschka
ISVC
2010
Springer
14 years 8 months ago
A Human Inspired Local Ratio-Based Algorithm for Edge Detection in Fluorescent Cell Images
Abstract. We have developed a new semi-automated method for segmenting images of biological cells seeded at low density on tissue culture substrates, which we use to improve the ge...
Joe Chalfoun, Alden Dima, Adele P. Peskin, John T....
BIRD
2008
Springer
110views Bioinformatics» more  BIRD 2008»
14 years 11 months ago
SVM-Based Local Search for Gene Selection and Classification of Microarray Data
Abstract. This paper presents a SVM-based local search (SVM-LS) approach to the problem of gene selection and classification of microarray data. The proposed approach is highlighte...
Jose Crispin Hernandez Hernandez, Béatrice ...
SPAA
1996
ACM
15 years 1 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick