Sciweavers

151 search results - page 12 / 31
» Longest Common Pattern between two Permutations
Sort
View
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
13 years 9 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
IPPS
2008
IEEE
14 years 1 months ago
On synthesizing workloads emulating MPI applications
Evaluation of high performance parallel systems is a delicate issue, due to the difficulty of generating workloads that represent, with fidelity, those that will run on actual sys...
Javier Navaridas, José Miguel-Alonso, Franc...
DAGSTUHL
1990
13 years 8 months ago
Integrating Rules and Connectionism for Robust Reasoning
A connectionist model for robust reasoning, CONSYDERR, is proposed to account for some common reasoning patterns found in commonsense reasoning and to remedy the brittleness probl...
Ron Sun
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 7 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
IJCNLP
2005
Springer
14 years 28 days ago
Exploring Syntactic Relation Patterns for Question Answering
Abstract. In this paper, we explore the syntactic relation patterns for opendomain factoid question answering. We propose a pattern extraction method to extract the various relatio...
Dan Shen, Geert-Jan M. Kruijff, Dietrich Klakow