Sciweavers

3008 search results - page 128 / 602
» Independence in connected graphs
Sort
View
BIS
2008
119views Business» more  BIS 2008»
15 years 7 months ago
Fuzzy Constraint-based Schema Matching Formulation
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
Alsayed Algergawy, Eike Schallehn, Gunter Saake
TCS
2010
15 years 1 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal
DCOSS
2007
Springer
16 years 17 days ago
A Connectivity Based Partition Approach for Node Scheduling in Sensor Networks
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
Yong Ding, Chen Wang, Li Xiao
ISBI
2004
IEEE
16 years 7 months ago
The Influence of Heart Beat and Respiration on Functional Connectivity Networks
We investigate the influence of physiological measures like heart beat and respiration on functional connectivity networks from fMRI. Cardiac and respiratory effects were measured...
Silke Dodel, Jean-Baptiste Poline, Jean-Luc Anton,...
CDC
2008
IEEE
116views Control Systems» more  CDC 2008»
16 years 27 days ago
Effective sensing regions and connectivity of agents undergoing periodic relative motions
— Time-varying graphs are widely used to model communication and sensing in multi-agent systems such as mobile sensor networks and dynamic animal groups. Connectivity is often de...
Daniel T. Swain, Ming Cao, Naomi Ehrich Leonard