Sciweavers

588 search results - page 118 / 118
» Modeling and Verifying Circuits Using Generalized Relative T...
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 5 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
WWW
2011
ACM
13 years 21 days 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
SDM
2011
SIAM
218views Data Mining» more  SDM 2011»
12 years 8 months ago
Segmented nestedness in binary data
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
Esa Junttila, Petteri Kaski