2638 search results - page 223 / 528 » Random Geometric Complexes |
169
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
173
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we study instances of complex neural networks, i.e. neural networks with complex topologies. We use Self-Organizing Map neural networks whose neighborhood relations...
180
click to vote
PAKDD
2001
ACM
15 years 11 months ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
178
click to vote
AAAI
2008
15 years 9 months ago
2008
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelik...
175
click to vote
MP
2007
15 years 6 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...