Sciweavers

4865 search results - page 139 / 973
» The Complexity of Graph Connectivity
Sort
View
FCT
2011
Springer
12 years 10 months ago
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen...
ALGOSENSORS
2009
Springer
14 years 5 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
14 years 5 months 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...
AAMAS
2007
Springer
13 years 11 months ago
A formal framework for connective stability of highly decentralized cooperative negotiations
Abstract. Multiagent cooperative negotiation is a promising technique for modeling and controlling complex systems. Effective and flexible cooperative negotiations are especially...
Francesco Amigoni, Nicola Gatti
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
14 years 11 months ago
Computing Clusters of Correlation Connected Objects
The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the fe...
Christian Böhm, Karin Kailing, Peer Krög...