Sciweavers

539 search results - page 78 / 108
» Linear complexity of transformed sequences
Sort
View
BMCBI
2006
128views more  BMCBI 2006»
14 years 9 months ago
Comparative assessment of performance and genome dependence among phylogenetic profiling methods
Background: The rapidly increasing speed with which genome sequence data can be generated will be accompanied by an exponential increase in the number of sequenced eukaryotes. Wit...
Evan S. Snitkin, Adam M. Gustafson, Joseph C. Mell...
103
Voted
PLANX
2008
14 years 11 months ago
XML Type Checking for Macro Tree Transducers with Holes
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because t...
Sebastian Maneth, Keisuke Nakano
94
Voted
ICFP
2008
ACM
15 years 9 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
IPPS
2007
IEEE
15 years 4 months ago
POET: Parameterized Optimizations for Empirical Tuning
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
Qing Yi, Keith Seymour, Haihang You, Richard W. Vu...
RSCTC
2000
Springer
197views Fuzzy Logic» more  RSCTC 2000»
15 years 1 months ago
Rough Set Approach to CBR
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
Jan Wierzbicki