Sciweavers

436 search results - page 64 / 88
» Recursion and Complexity
Sort
View
ICPADS
2005
IEEE
14 years 2 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
DATE
2002
IEEE
79views Hardware» more  DATE 2002»
14 years 2 months ago
Formulation of Low-Order Dominant Poles for Y-Matrix of Interconnects
This paper presents an efficient approach to compute the dominant poles for the reduced-order admittance (Y parameter) matrix of lossy interconnects. Using the global approximati...
Qinwei Xu, Pinaki Mazumder
AI
2008
Springer
13 years 9 months ago
On the notion of concept I
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
Michael Freund
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 8 months ago
On Factor Universality in Symbolic Spaces
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on ...
Laurent Boyer, Guillaume Theyssier
JMMA
2010
90views more  JMMA 2010»
13 years 3 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke