699 search results - page 91 / 140 » The method of combinatorial telescoping |
113
click to vote
STOC
2004
ACM
16 years 26 days ago
2004
ACM
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...
88
Voted
EUROGRAPHICS
2010
Eurographics
15 years 9 months ago
2010
Eurographics
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
88
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
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...
125
Voted
BMCBI
2010
15 years 21 days ago
2010
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...
105
Voted
BMCBI
2008
15 years 21 days ago
2008
Background: Understanding how genes are expressed and regulated in different tissues is a fundamental and challenging question. However, most of currently available biological dat...