7840 search results - page 342 / 1568 » On generalized Ramsey numbers |
165
click to vote
APPT
2007
Springer
16 years 1 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
169
click to vote
ECML
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we study the identification of sparse interaction networks as a machine learning problem. Sparsity means that we are provided with a small data set and a high number...
205
click to vote
EMSOFT
2007
Springer
16 years 1 months ago
2007
Springer
We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types a...
168
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
157
Voted
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarante...