1552 search results - page 220 / 311 » On the Complexity of Constant Propagation |
191
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
172
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
198
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
170
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
115
click to vote
ICASSP
2008
IEEE
16 years 27 days ago
2008
IEEE
The aim of this article is to recall the applications of the topological asymptotic expansion to many image processing problems. We briefly review the topological asymptotic analy...