Sciweavers

826 search results - page 133 / 166
» Designing for families
Sort
View
JAL
1998
85views more  JAL 1998»
14 years 9 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
JMIV
1998
93views more  JMIV 1998»
14 years 9 months ago
Connectivity on Complete Lattices
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Jean Serra
PPDP
2010
Springer
14 years 8 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch
60
Voted
TASLP
2010
99views more  TASLP 2010»
14 years 8 months ago
A Virtual Model of Spring Reverberation
—The digital emulation of analog audio effects and synthesis components, through the simulation of lumped circuit components has seen a large amount of activity in recent years; ...
Stefan Bilbao, Julian Parker
BIS
2010
197views Business» more  BIS 2010»
14 years 7 months ago
Ubiquitous Microblogging: A Flow-Based Front-End for Information Logistics
The success of information supply strongly depends on successful user adoption. This especially is the case for the integration of non-human information sources deriving from ubiqu...
Martin Böhringer, Martin Gaedke