Sciweavers

5606 search results - page 50 / 1122
» Randomization Techniques for Graphs.
Sort
View
CMSB
2006
Springer
14 years 27 days ago
Randomization and Feedback Properties of Directed Graphs Inspired by Gene Networks
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
M. Cosentino Lagomarsino, P. Jona, B. Bassetti
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 10 months ago
Reconstruction from Randomized Graph via Low Rank Approximation
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreservin...
Leting Wu, Xiaowei Ying, Xintao Wu
ICDE
2002
IEEE
116views Database» more  ICDE 2002»
14 years 10 months ago
SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks
Scalable storage architectures allow for the addition of disks to increase storage capacity and/or bandwidth. In its general form, disk scaling also refers to disk removals when e...
Ashish Goel, Cyrus Shahabi, Shu-Yuen Didi Yao, Rog...
IJCNLP
2005
Springer
14 years 2 months ago
Regularisation Techniques for Conditional Random Fields: Parameterised Versus Parameter-Free
Recent work on Conditional Random Fields (CRFs) has demonstrated the need for regularisation when applying these models to real-world NLP data sets. Conventional approaches to regu...
Andrew Smith, Miles Osborne
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 3 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...