• 2011
• 
  Hengzhe Li, Xueliang Li, Sujuan Liu:
  The (strong) rainbow connection numbers of Cayley graphs on Abelian groups. Comput. Math. Appl. 62(11): 4082-4088 (2011)
• 
  Ray E. Reagans:
  Close Encounters: Analyzing How Social Similarity and Propinquity Contribute to Strong Network Connections. Organ. Sci. 22(4): 835-849 (2011)
• 2009
• 
  Amir Epstein, Michal Feldman, Yishay Mansour:
  Strong equilibrium in cost sharing connection games. Games Econ. Behav. 67(1): 51-68 (2009)
• 
  Stan Matwin:
  Image Analysis and Machine Learning: How to Foster a Stronger Connection? ICIAP 2009: 5
• 2008
• 
  Edwin J. Beggs, Tomasz Brzezinski:
  An Explicit Formula for a Strong Connection. Appl. Categorical Struct. 16(1-2): 57-63 (2008)
• 
  Ghassen Ben Brahim, Bilal Khan, Ala I. Al-Fuqaha, Mohsen Guizani:
  Weak many vs. strong few: reducing BER through packet duplication in power-budgeted wireless connections. Int. J. Sens. Networks 4(3): 145-154 (2008)
• 
  Li Ding, Brandon Dixon:
  Using an edge-dual graph and k-connectivity to identify strong connections in social networks. ACM Southeast Regional Conference 2008: 475-480
• 2007
• 
  Jonathan David Farley:
  A structure theorem for posets admitting a "strong" chain partition: : A generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities). Discret. Math. 307(2): 191-198 (2007)
• 
  Amir Epstein, Michal Feldman, Yishay Mansour:
  Strong equilibrium in cost sharing connection games. EC 2007: 84-92
• 2006
• 
  Giampiero Salvi:
  Dynamic behaviour of connectionist speech recognition with strong latency constraints. Speech Commun. 48(7): 802-818 (2006)
• 2002
• 
  Jörg H. Siekmann, Graham Wrightson:
  An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure. Log. J. IGPL 10(1): 85-103 (2002)
• 
  Jörg H. Siekmann, Graham Wrightson:
  An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure. Computational Logic: Logic Programming and Beyond 2002: 231-252
• 
  Quan Yuan, Wen Gao, Hongxun Yao, Chunli Wang:
  Recognition of Strong and Weak Connection Models in Continuous Sign Language. ICPR (1) 2002: 75-78
• 
  Vasile Postolica:
  General connection between strong optimization and Pareto efficiency. Analysis and Optimization of Differential Systems 2002: 315-320
• 2001
• 
  Jörg H. Siekmann, Graham Wrightson:
  Erratum: a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution. J. ACM 48(1): 145-147 (2001)
• 1997
• 
  Wolfgang Bibel, Elmar Eder:
  Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution. J. ACM 44(2): 320-344 (1997)
• 
  Robert F. Hadley, Michael B. Hayward:
  Strong Semantic Systematicity from Hebbian Connectionist Learning. Minds Mach. 7(1): 1-37 (1997)
• 1996
• 
  Stefano Borgo, Nicola Guarino, Claudio Masolo:
  A Pointless Theory of Space Based on Strong Connection and Congruence. KR 1996: 220-229
• 1995
• 
  James W. Fickett:
  ORFs and Genes: How Strong a Connection? J. Comput. Biol. 2(1): 117-123 (1995)

[<< prev] #30 -- #48