Sciweavers

3008 search results - page 119 / 602
» Independence in connected graphs
Sort
View
AINA
2008
IEEE
16 years 26 days ago
Extending Always Best Connected Paradigm for Voice Communications in Next Generation Wireless Network
Selecting transparently a proper network connection for voice communication will be a fundamental requirement in future multi-mode heterogeneous wireless network. This paper exten...
Tein-Yaw Chung, Fong-Ching Yuan, Yung-Mu Chen, Baw...
MICCAI
2009
Springer
16 years 7 months ago
Tractography-Based Parcellation of the Cortex Using a Spatially-Informed Dimension Reduction of the Connectivity Matrix
Determining cortical functional areas is an important goal for neurosciences and clinical neurosurgery. This paper presents a method for connectivity-based parcellation of the enti...
Cyril Poupon, Denis Rivière, Jean-Francois ...
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
15 years 4 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
ALGOSENSORS
2009
Springer
16 years 1 months ago
A Note on Uniform Power Connectivity in the SINR Model
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne ...
COMSWARE
2007
IEEE
16 years 22 days ago
Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...
François Ingelrest, David Simplot-Ryl, Ivan...