Sciweavers

17366 search results - page 3061 / 3474
» New Revision Algorithms
Sort
View
RV
2010
Springer
172views Hardware» more  RV 2010»
15 years 5 months ago
Recovery Tasks: An Automated Approach to Failure Recovery
Abstract. We present a new approach for developing robust software applications that breaks dependences on the failed parts of an application’s execution to allow the rest of the...
Brian Demsky, Jin Zhou, William Montaz
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
15 years 5 months ago
Complexity of Safe Strategic Voting
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
Noam Hazon, Edith Elkind
SDM
2010
SIAM
166views Data Mining» more  SDM 2010»
15 years 5 months ago
Directed Network Community Detection: A Popularity and Productivity Link Model
In this paper, we consider the problem of community detection in directed networks by using probabilistic models. Most existing probabilistic models for community detection are ei...
Tianbao Yang, Yun Chi, Shenghuo Zhu, Yihong Gong, ...
SPIRE
2010
Springer
15 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
SPRINGSIM
2010
15 years 5 months ago
GTNA: a framework for the graph-theoretic network analysis
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
Benjamin Schiller, Dirk Bradler, Immanuel Schweize...
« Prev « First page 3061 / 3474 Last » Next »