Sciweavers

1186 search results - page 21 / 238
» Improving Random Walk Performance
Sort
View
ICAPR
2005
Springer
14 years 4 months ago
The RW2 Algorithm for Exact Graph Matching
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
Marco Gori, Marco Maggini, Lorenzo Sarti
NIPS
2007
14 years 10 days ago
Semi-Supervised Multitask Learning
A semi-supervised multitask learning (MTL) framework is presented, in which M parameterized semi-supervised classifiers, each associated with one of M partially labeled data mani...
Qiuhua Liu, Xuejun Liao, Lawrence Carin
GLOBECOM
2010
IEEE
13 years 9 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun
STACS
2009
Springer
14 years 5 months ago
A Comparison of Techniques for Sampling Web Pages
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to...
Eda Baykan, Monika Rauch Henzinger, Stefan F. Kell...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
14 years 21 days ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau