Sciweavers

30 search results - page 6 / 6
» The universal resolving algorithm and its correctness: inver...
Sort
View
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
13 years 12 months ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson
ICALP
2009
Springer
14 years 6 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
PLDI
2010
ACM
13 years 10 months ago
A GPGPU compiler for memory optimization and parallelism management
This paper presents a novel optimizing compiler for general purpose computation on graphics processing units (GPGPU). It addresses two major challenges of developing high performa...
Yi Yang, Ping Xiang, Jingfei Kong, Huiyang Zhou
JCC
2011
154views more  JCC 2011»
12 years 8 months ago
Can we trust docking results? Evaluation of seven commonly used programs on PDBbind database
: Docking is one of the most commonly used techniques in drug design. It is used for both identifying correct poses of a ligand in the binding site of a protein as well as for the ...
Dariusz Plewczynski, Michal Lazniewski, Rafal Augu...
PLDI
1997
ACM
13 years 10 months ago
Componential Set-Based Analysis
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
Cormac Flanagan, Matthias Felleisen