Sciweavers

2503 search results - page 310 / 501
» A study of 3-arc graphs
Sort
View
SPAA
2010
ACM
15 years 10 months ago
Delays induce an exponential memory gap for rendezvous in trees
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
Pierre Fraigniaud, Andrzej Pelc
SIAMJO
2010
121views more  SIAMJO 2010»
15 years 4 months ago
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
Identifying small groups of lines, whose removal would cause a severe blackout, is critical for the secure operation of the electric power grid. We show how power grid vulnerabilit...
Ali Pinar, Juan Meza, Vaibhav Donde, Bernard C. Le...
WEBI
2010
Springer
15 years 3 months ago
Lightweight Clustering Methods for Webspam Demotion
Abstract--To make sure they can quickly respond to a specific query, the main search engines have several mechanisms. One of them consists in ranking web pages according to their i...
Thomas Largillier, Sylvain Peyronnet
PLDI
2011
ACM
14 years 8 months ago
Isolating and understanding concurrency errors using reconstructed execution fragments
In this paper we propose Recon, a new general approach to concurrency debugging. Recon goes beyond just detecting bugs, it also presents to the programmer short fragments of buggy...
Brandon Lucia, Benjamin P. Wood, Luis Ceze
SIGIR
2011
ACM
14 years 8 months ago
Social context summarization
We study a novel problem of social context summarization for Web documents. Traditional summarization research has focused on extracting informative sentences from standard docume...
Zi Yang, Keke Cai, Jie Tang, Li Zhang, Zhong Su, J...