Sciweavers

1004 search results - page 96 / 201
» Product representations of polynomials
Sort
View
96
Voted
ENTCS
2008
99views more  ENTCS 2008»
15 years 25 days ago
SPPF-Style Parsing From Earley Recognisers
In its recogniser form, Earley's algorithm for testing whether a string can be derived from a grammar is worst case cubic on general context free grammars (CFG). Earley gave ...
Elizabeth Scott
CORR
2007
Springer
165views Education» more  CORR 2007»
15 years 22 days ago
Comparison of Tree-Child Phylogenetic Networks
Abstract—Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization...
Gabriel Cardona, Francesc Rosselló, Gabriel...
67
Voted
JCT
2011
87views more  JCT 2011»
14 years 7 months ago
Chain enumeration of k-divisible noncrossing partitions of classical types
We give combinatorial proofs of the formulas for the number of multichains in the k-divisible noncrossing partitions of classical types with certain conditions on the rank and the ...
Jang Soo Kim
89
Voted
JC
2011
87views more  JC 2011»
14 years 7 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
117
Voted
SPLC
2010
14 years 11 months ago
Stratified Analytic Hierarchy Process: Prioritization and Selection of Software Features
Product line engineering allows for the rapid development of variants of a domain specific application by using a common set of reusable assets often known as core assets. Variabil...
Ebrahim Bagheri, Mohsen Asadi, Dragan Gasevic, Sam...