Sciweavers

1973 search results - page 12 / 395
» The Construction of Ludic Space
Sort
View
BMCBI
2010
122views more  BMCBI 2010»
13 years 2 months ago
Functional enrichment analyses and construction of functional similarity networks with high confidence function prediction by PF
Background: A new paradigm of biological investigation takes advantage of technologies that produce large high throughput datasets, including genome sequences, interactions of pro...
Troy Hawkins, Meghana Chitale, Daisuke Kihara
CPM
2009
Springer
183views Combinatorics» more  CPM 2009»
13 years 5 months ago
Permuted Longest-Common-Prefix Array
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
Juha Kärkkäinen, Giovanni Manzini, Simon...
EXPERT
1998
83views more  EXPERT 1998»
13 years 7 months ago
Data-Driven Constructive Induction
Constructive induction divides the problem of learning an inductive hypothesis into two intertwined searches: one—for the “best” representation space, and two—for the “be...
Eric Bloedorn, Ryszard S. Michalski
MMB
2012
Springer
259views Communications» more  MMB 2012»
12 years 2 months ago
Boosting Design Space Explorations with Existing or Automatically Learned Knowledge
Abstract. During development, processor architectures can be tuned and configured by many different parameters. For benchmarking, automatic design space explorations (DSEs) with h...
Ralf Jahr, Horia Calborean, Lucian Vintan, Theo Un...
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 1 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman