Sciweavers

425 search results - page 28 / 85
» On the additive constant of the k-server Work Function Algor...
Sort
View
PDCN
2004
13 years 9 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
IPL
2008
129views more  IPL 2008»
13 years 7 months ago
Parameterized approximation of dominating set problems
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
Rodney G. Downey, Michael R. Fellows, Catherine Mc...
SIAMSC
2008
151views more  SIAMSC 2008»
13 years 7 months ago
Accurate Floating-Point Summation Part I: Faithful Rounding
Given a vector of floating-point numbers with exact sum s, we present an algorithm for calculating a faithful rounding of s, i.e. the result is one of the immediate floating-point ...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi
WOWMOM
2009
ACM
158views Multimedia» more  WOWMOM 2009»
14 years 2 months ago
Admission control based on OFDMA channel transformations
It is well known that channel-dependent OFDMA resource assignment algorithms provide a significant performance improvement compared to static (i.e. channelunaware) approaches. Su...
James Gross
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
14 years 8 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...