Sciweavers

618 search results - page 16 / 124
» Short cycle connectivity
Sort
View
JSW
2006
111views more  JSW 2006»
13 years 9 months ago
AppBus: Mobile Device Application Collaboration via Short Term Memory
The increasing quality of computation and connectivity on mobile devices has motivated a need for data-sharing between resident services. Most such services rely on the user to tra...
Craig Janssen, Michael Pearce, Shriram Kollipara, ...
IPL
2008
109views more  IPL 2008»
13 years 9 months ago
Description and analysis of a bottom-up DFA minimization algorithm
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
Jorge Almeida, Marc Zeitoun
CONNECTION
2006
101views more  CONNECTION 2006»
13 years 9 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
HICSS
2007
IEEE
125views Biometrics» more  HICSS 2007»
14 years 4 months ago
The Length of the Product Generation Life Cycle as a Moderator of Innovation Strategy: A Comparative Cross-Industry Study of Ten
This paper aims at exploring the role of the product generation life cycle (PGLC) on differences in innovation strategy among industries in a crossindustry study of ten multinatio...
Frances T. J. M. Fortuin, S. W. F. Omta
ESA
2009
Springer
146views Algorithms» more  ESA 2009»
14 years 4 months ago
Kernel Bounds for Disjoint Cycles and Disjoint Paths
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
Hans L. Bodlaender, Stéphan Thomassé...