Sciweavers

218 search results - page 41 / 44
» Constant Rate Approximate Maximum Margin Algorithms
Sort
View
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 8 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
WAOA
2010
Springer
236views Algorithms» more  WAOA 2010»
13 years 5 months ago
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
Patrick Briest, Heiko Röglin
ISCAS
2005
IEEE
167views Hardware» more  ISCAS 2005»
14 years 1 months ago
Low-power log-MAP turbo decoding based on reduced metric memory access
Due to the powerful error correcting performance, turbo codes have been adopted in many wireless communication standards. Although several low-power techniques have been proposed,...
Dong-Soo Lee, In-Cheol Park
FPL
2009
Springer
148views Hardware» more  FPL 2009»
14 years 7 days ago
Comparing fine-grained performance on the Ambric MPPA against an FPGA
A simple image-processing application is implemented on the Ambric MPPA and an FPGA, using a similar implementation for both devices. FPGAs perform extremely well on this kind of ...
Brad L. Hutchings, Brent E. Nelson, Stephen West, ...
EOR
2008
78views more  EOR 2008»
13 years 7 months ago
Maximizing throughput in queueing networks with limited flexibility
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
Douglas G. Down, George Karakostas