Sciweavers

26 search results - page 5 / 6
» Random graphs and the parity quantifier
Sort
View
DCOSS
2006
Springer
13 years 11 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
AIRWEB
2005
Springer
14 years 29 days ago
Optimal Link Bombs are Uncoordinated
We analyze the recent phenomenon termed a Link Bomb, and investigate the optimal attack pattern for a group of web pages attempting to link bomb a specific web page. The typical ...
Sibel Adali, Tina Liu, Malik Magdon-Ismail
CORR
2011
Springer
200views Education» more  CORR 2011»
13 years 2 months ago
An Analysis of Optimal Link Bombs
We analyze the recent phenomenon termed a Link Bomb, and investigate the optimal attack pattern for a group of web pages attempting to link bomb a specific web page. The typical ...
Sibel Adali, Tina Liu, Malik Magdon-Ismail
WEBI
2007
Springer
14 years 1 months ago
Blog Community Discovery and Evolution Based on Mutual Awareness Expansion
There are information needs involving costly decisions that cannot be efficiently satisfied through conventional web search engines. Alternately, community centric search can prov...
Yu-Ru Lin, Hari Sundaram, Yun Chi, Jun'ichi Tatemu...
INFOCOM
2002
IEEE
14 years 10 days ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic