5606 search results - page 180 / 1122 » Randomization Techniques for Graphs. |
104
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
103
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
138
click to vote
CORR
2010
Springer
15 years 23 days ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
108
click to vote
IJSI
2008
15 years 20 days ago
2008
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
115
Voted
PDP
2006
IEEE
15 years 6 months ago
2006
IEEE
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...