Sciweavers

1541 search results - page 19 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
ECAI
2006
Springer
14 years 24 days ago
Random Subset Optimization
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
Boi Faltings, Quang Huy Nguyen
TIT
2010
61views Education» more  TIT 2010»
13 years 3 months ago
Tunstall code, Khodak variations, and random walks
A variable-to-fixed length encoder partitions the source string into variable-length phrases that belong to a given and fixed dictionary. Tunstall, and independently Khodak, desig...
Michael Drmota, Yuriy A. Reznik, Wojciech Szpankow...
MM
2006
ACM
190views Multimedia» more  MM 2006»
14 years 3 months ago
Image annotation refinement using random walk with restarts
Image annotation plays an important role in image retrieval and management. However, the results of the state-of-the-art image annotation methods are often unsatisfactory. Therefo...
Changhu Wang, Feng Jing, Lei Zhang, HongJiang Zhan...
ISCIS
2005
Springer
14 years 2 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
ASUNAM
2010
IEEE
13 years 10 months ago
A Unified Framework for Link Recommendation Using Random Walks
The phenomenal success of social networking sites, such as Facebook, Twitter and LinkedIn, has revolutionized the way people communicate. This paradigm has attracted the attention ...
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han