Sciweavers

2060 search results - page 319 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
143
Voted
CORR
2006
Springer
160views Education» more  CORR 2006»
15 years 4 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
FOCS
2009
IEEE
15 years 11 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 9 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
TCAD
2008
127views more  TCAD 2008»
15 years 4 months ago
Speculative Loop-Pipelining in Binary Translation for Hardware Acceleration
Abstract--Multimedia and DSP applications have several computationally intensive kernels which are often offloaded and accelerated by application-specific hardware. This paper pres...
Sejong Oh, Tag Gon Kim, Jeonghun Cho, Elaheh Bozor...
SOQUA
2007
15 years 5 months ago
ConTest listeners: a concurrency-oriented infrastructure for Java test and heal tools
With the proliferation of the new multi-core personal computers, and the explosion of the usage of highly concurrent machine configuration, concurrent code moves from being writt...
Yarden Nir-Buchbinder, Shmuel Ur