2200 search results - page 247 / 440 » Bloch's Constant is Computable |
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...
165
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
144
click to vote
COCOON
2007
Springer
16 years 20 days ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
167
click to vote
EUROCRYPT
2007
Springer
16 years 20 days ago
2007
Springer
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...
172
click to vote
ICALP
2007
Springer
16 years 19 days ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...