8196 search results - page 393 / 1640 » Computational Modeling and Complexity Science |
155
click to vote
MFCS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are c...
156
click to vote
MFCS
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of effective dim...
178
click to vote
ICDCN
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
178
click to vote
ACMSE
1992
ACM
15 years 11 months ago
1992
ACM
A scheme for disk subsystem performance enhancement that is based on (virtual) cylinder remapping is proposed. A natural workload on a real system is measured, and statistical tes...
178
click to vote
DIS
2004
Springer
15 years 10 months ago
2004
Springer
Bayesian classifiers such as Naive Bayes or Tree Augmented Naive Bayes (TAN) have shown excellent performance given their simplicity and heavy underlying independence assumptions....