Sciweavers

1542 search results - page 33 / 309
» The metamathematics of random graphs
Sort
View
PROPERTYTESTING
2010
14 years 7 months ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon
ACL
2010
14 years 7 months ago
Identifying Text Polarity Using Random Walks
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
Ahmed Hassan, Dragomir R. Radev
CORR
2012
Springer
272views Education» more  CORR 2012»
13 years 5 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
IPL
2011
88views more  IPL 2011»
14 years 4 months ago
Smooth movement and Manhattan path based Random Waypoint mobility
In this paper, we study the stationary node distribution of a variation of the Random Waypoint mobility model, in which nodes move in a smooth way following one randomly chosen Ma...
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Do...
RSA
2010
99views more  RSA 2010»
14 years 8 months ago
Hamiltonicity thresholds in Achlioptas processes
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov