Sciweavers

2004 search results - page 142 / 401
» Sampling from large graphs
Sort
View
AIRWEB
2007
Springer
15 years 9 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
FMOODS
2006
15 years 4 months ago
Generating Instance Models from Meta Models
Meta modeling is a wide-spread technique to define visual languages, with the UML being the most prominent one. Despite several advantages of meta modeling such as ease of use, the...
Karsten Ehrig, Jochen Malte Küster, Gabriele ...
JMLR
2010
136views more  JMLR 2010»
14 years 10 months ago
Predicting the functions of proteins in Protein-Protein Interaction networks from global information
In this work we present a novel approach to predict the function of proteins in protein-protein interaction (PPI) networks. We classify existing approaches into inductive and tran...
Hossein Rahmani, Hendrik Blockeel, Andreas Bender
128
Voted
FOCS
2009
IEEE
15 years 10 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
DILS
2004
Springer
15 years 8 months ago
Links and Paths through Life Sciences Data Sources
An abundance of biological data sources contain data on classes of scientific entities, such as genes and sequences. Logical relationships between scientific objects are implemen...
Zoé Lacroix, Hyma Murthy, Felix Naumann, Lo...