Sciweavers

1507 search results - page 295 / 302
» Summary
Sort
View
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 8 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
TIFS
2010
186views more  TIFS 2010»
13 years 8 months ago
An abuse-free fair contract-signing protocol based on the RSA signature
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
Guilin Wang
WABI
2010
Springer
167views Bioinformatics» more  WABI 2010»
13 years 8 months ago
Quantifying the Strength of Natural Selection of a Motif Sequence
Quantification of selective pressures on regulatory sequences is a central question in studying the evolution of gene regulatory networks. Previous methods focus primarily on sing...
Chen-Hsiang Yeang
ANCS
2010
ACM
13 years 8 months ago
Ensemble routing for datacenter networks
: Ensemble Routing For Datacenter Networks Mike Schlansker, Yoshio Turner, Jean Tourrilhes, Alan Karp HP Laboratories HPL-2010-120 Networks, Ethernet, Multipath, Switching, Fault ...
Mike Schlansker, Yoshio Turner, Jean Tourrilhes, A...
CIKM
2010
Springer
13 years 7 months ago
Manifold ranking with sink points for update summarization
Update summarization aims to create a summary over a topic-related multi-document dataset based on the assumption that the user has already read a set of earlier documents of the ...
Pan Du, Jiafeng Guo, Jin Zhang, Xueqi Cheng