Sciweavers

145 search results - page 29 / 29
» Mining closed relational graphs with connectivity constraint...
Sort
View
CSMR
2010
IEEE
13 years 5 months ago
Does the Past Say It All? Using History to Predict Change Sets in a CMDB
To avoid unnecessary maintenance costs in large IT systems resulting from poorly planned changes, it is essential to manage and control changes to the system and to verify that all...
Sarah Nadi, Richard C. Holt, Serge Mankovski
WWW
2011
ACM
13 years 5 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
WIOPT
2006
IEEE
14 years 4 months ago
Color-based broadcasting for ad hoc networks
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...
Alireza Keshavarz-Haddad, Vinay J. Ribeiro, Rudolf...
BMCBI
2010
110views more  BMCBI 2010»
13 years 11 months ago
Towards the systematic discovery of signal transduction networks using phosphorylation dynamics data
Background: Phosphorylation is a ubiquitous and fundamental regulatory mechanism that controls signal transduction in living cells. The number of identified phosphoproteins and th...
Haruna Imamura, Nozomu Yachie, Rintaro Saito, Yasu...
WWW
2004
ACM
14 years 11 months ago
Dynamic assembly of learning objects
This paper describes one solution to the problem of how to select sequence, and link Web resources into a coherent, focused organization for instruction that addresses a user'...
Robert G. Farrell, Soyini D. Liburd, John C. Thoma...