Sciweavers

10608 search results - page 244 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
115
Voted
ICMLA
2008
15 years 1 months ago
Predicting Algorithm Accuracy with a Small Set of Effective Meta-Features
We revisit 26 meta-features typically used in the context of meta-learning for model selection. Using visual analysis and computational complexity considerations, we find 4 meta-f...
Jun Won Lee, Christophe G. Giraud-Carrier
83
Voted
CJ
2010
98views more  CJ 2010»
15 years 18 days ago
On Ultrametric Algorithmic Information
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present prac...
Fionn Murtagh
100
Voted
IPL
2006
79views more  IPL 2006»
15 years 14 days ago
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation ter...
Jeng Farn Lee, Meng Chang Chen, Ming-Tat Ko, Wanji...
127
Voted
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 7 months ago
A recombination algorithm for the decomposition of multivariate rational functions
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
Guillaume Chèze
95
Voted
JSC
2007
84views more  JSC 2007»
15 years 11 days ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger