Sciweavers

2310 search results - page 409 / 462
» Coloring Random Graphs
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Multicast capacity for hybrid wireless networks
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
XuFei Mao, Xiang-Yang Li, ShaoJie Tang
WWW
2009
ACM
14 years 8 months ago
Tag ranking
Social media sharing web sites like Flickr allow users to annotate images with free tags, which significantly facilitate Web image search and organization. However, the tags assoc...
Dong Liu, Xian-Sheng Hua, Linjun Yang, Meng Wang, ...
DSN
2009
IEEE
14 years 2 months ago
Verme: Worm containment in overlay networks
Topological worms, such as those that propagate by following links in an overlay network, have the potential to spread faster than traditional random scanning worms because they h...
Filipe Freitas, Edgar Marques, Rodrigo Rodrigues, ...
FOCS
2007
IEEE
14 years 2 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
BROADNETS
2005
IEEE
14 years 1 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz