Sciweavers

520 search results - page 92 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
JCC
2011
109views more  JCC 2011»
12 years 10 months ago
VoteDock: Consensus docking method for prediction of protein-ligand interactions
: Molecular recognition plays a fundamental role in all biological processes, and that is why great efforts have been made to understand and predict protein–ligand interactions. ...
Dariusz Plewczynski, Michal Lazniewski, Marcin von...
PLDI
2012
ACM
11 years 9 months ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 7 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
JOC
2000
95views more  JOC 2000»
13 years 7 months ago
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
Martin Hirt, Ueli M. Maurer
UM
2009
Springer
14 years 1 months ago
Narcissus: Group and Individual Models to Support Small Group Work
Long term group work by small teams is a central part of many learning and workplace activities. Widespread group support tools such as wikis, version control systems and issue tra...
Kimberley Upton, Judy Kay