Sciweavers

11381 search results - page 47 / 2277
» Connectivity
Sort
View
IJON
2006
109views more  IJON 2006»
14 years 9 months ago
Associative memory of connectivity patterns
The goal of the visual correspondence problem is to establish a connectivity pattern (a mapping) between two images such that features projected from the same scene point are conn...
Junmei Zhu, Christoph von der Malsburg
ENTCS
2007
82views more  ENTCS 2007»
14 years 9 months ago
On the Computational Representation of Classical Logical Connectives
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...
Jayshan Raghunandan, Alexander J. Summers
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
14 years 9 months ago
Airy Phenomena and Analytic Combinatorics of Connected Graphs
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
Philippe Flajolet, Bruno Salvy, Gilles Schaeffer
PSYCHNOLOGY
2007
96views more  PSYCHNOLOGY 2007»
14 years 9 months ago
A First-time Wireless Internet Connection: More Than Just Clicking on a Link
In the context of understanding the particular use made of nomad Internet and mobile computing in its interactional dimension, this article examines the detail of a first-time con...
Dimitri Voilmy, Karine Lan Hing Ting
JGT
2010
103views more  JGT 2010»
14 years 8 months ago
Characterizing 3-connected planar graphs and graphic matroids
: A well-known result of Tutte states that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cun...
Manoel Lemos, Talmage James Reid, Haidong Wu