Sciweavers

3008 search results - page 531 / 602
» Independence in connected graphs
Sort
View
CISS
2008
IEEE
15 years 6 months ago
Detection of anomalous meetings in a social network
Abstract-- When monitoring interactions within a social network, meetings or contacts between different members of the network are recorded. This paper addresses the problem of usi...
Jorge Silva, Rebecca Willett
AHSWN
2008
92views more  AHSWN 2008»
15 years 6 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
BMCBI
2007
115views more  BMCBI 2007»
15 years 6 months ago
How accurate and statistically robust are catalytic site predictions based on closeness centrality?
Background: We examine the accuracy of enzyme catalytic residue predictions from a network representation of protein structure. In this model, amino acid α-carbons specify vertic...
Eric Chea, Dennis R. Livesay
COMGEO
2008
ACM
15 years 6 months ago
Constructing minimum-interference networks
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
Marc Benkert, Joachim Gudmundsson, Herman J. Haver...
CORR
2010
Springer
140views Education» more  CORR 2010»
15 years 6 months ago
Image Segmentation by Discounted Cumulative Ranking on Maximal Cliques
We propose a mid-level image segmentation framework that combines multiple figure-ground hypothesis (FG) constrained at different locations and scales, into interpretations that t...
João Carreira, Adrian Ion, Cristian Sminchi...