Sciweavers

776 search results - page 14 / 156
» Distributed Information Regularization on Graphs
Sort
View
SPAA
2009
ACM
16 years 6 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
AIRWEB
2007
Springer
16 years 13 hour ago
Transductive Link Spam Detection
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
Dengyong Zhou, Chris Burges, Tao Tao
FOCS
2009
IEEE
16 years 17 days ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams
177
Voted
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 7 months 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