7796 search results - page 161 / 1560 » On Generalized Schur Numbers |
175
click to vote
IFIP
2004
Springer
15 years 12 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
173
click to vote
ESCIENCE
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
162
click to vote
IADIS
2008
15 years 8 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
132
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
: This paper will propose a novel star schema attribute induction as a new attribute induction paradigm and as improving from current attribute oriented induction. A novel star sch...
191
click to vote
TCS
2011
15 years 1 months ago
2011
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...