34 search results - page 1 / 7 » The Dense Simple Sets are Orbit Complete with Respect to the... |
APAL
1998
13 years 5 months ago
1998
We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets.
SETA
2004
Springer
13 years 10 months ago
2004
Springer
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
ECCV
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. The use of sparse invariant features to recognise classes of actions or objects has become common in the literature. However, features are often "engineered" to...
JSS
2007
13 years 5 months ago
2007
Effort prediction is a very important issue for software project management. Historical project data sets are frequently used to support such prediction. But missing data are oft...