Sciweavers

3008 search results - page 513 / 602
» Independence in connected graphs
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
WEBI
2009
Springer
16 years 29 days ago
From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns
Understanding query reformulation patterns is a key step towards next generation web search engines: it can help improving users’ web-search experience by predicting their inten...
Paolo Boldi, Francesco Bonchi, Carlos Castillo, Se...
AGILE
2009
Springer
210views GIS» more  AGILE 2009»
16 years 29 days ago
Detecting Hotspots in Geographic Networks
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
Kevin Buchin, Sergio Cabello, Joachim Gudmundsson,...
CIKM
2009
Springer
16 years 28 days ago
Networks, communities and kronecker products
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
Jure Leskovec
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
16 years 28 days ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd