Sciweavers

699 search results - page 91 / 140
» The method of combinatorial telescoping
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 10 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
EUROGRAPHICS
2010
Eurographics
14 years 6 months ago
Electors Voting for Fast Automatic Shape Correspondence
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
Oscar Kin-Chung Au, Chiew-Lan Tai, Daniel Cohen-Or...
COCOA
2008
Springer
13 years 11 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
BMCBI
2010
154views more  BMCBI 2010»
13 years 10 months ago
Binary image representation of a ligand binding site: its application to efficient sampling of a conformational ensemble
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...
Edon Sung, Sangsoo Kim, Whanchul Shin
BMCBI
2008
114views more  BMCBI 2008»
13 years 10 months ago
TiGER: A database for tissue-specific gene expression and regulation
Background: Understanding how genes are expressed and regulated in different tissues is a fundamental and challenging question. However, most of currently available biological dat...
Xiong Liu, Xueping Yu, Donald J. Zack, Heng Zhu, J...