Sciweavers

881 search results - page 12 / 177
» connection 2004
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 10 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
PERVASIVE
2004
Springer
14 years 3 months ago
ProxNet: Secure Dynamic Wireless Connection by Proximity Sensing
Abstract. This paper describesa method for establishing ad hoc and infrastructuremode wireless network connections based on physical proximity. Users can easily establish secure wi...
Jun Rekimoto, Takashi Miyaki, Michimune Kohno
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
13 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
COMBINATORICA
2011
12 years 9 months ago
On planarity of compact, locally connected, metric spaces
Thomassen [Combinatorica 24 (2004), 699–718] proved that a 2–connected, compact, locally connected metric space is homeomorphic to a subset of the sphere if and only if it doe...
R. Bruce Richter, Brendan Rooney, Carsten Thomasse...
ESANN
2004
13 years 11 months ago
Reducing connectivity by using cortical modular bands
The way information is represented and processed in a neural network may have important consequences on its computational power and complexity. Basically, information representatio...
Julien Vitay, Nicolas P. Rougier, Fréd&eacu...