Sciweavers

1486 search results - page 270 / 298
» Algorithms for two-box covering
Sort
View

Lecture Notes
742views
15 years 6 months ago
Computer Systems Analysis
Comparing systems using measurement, simulation, and queueing models. Common mistakes and how to avoid them, selection of techniques and metrics, art of data presentation, summariz...
Raj Jain
DAC
2008
ACM
14 years 9 months ago
ADAM: run-time agent-based distributed application mapping for on-chip communication
Design-time decisions can often only cover certain scenarios and fail in efficiency when hard-to-predict system scenarios occur. This drives the development of run-time adaptive s...
Jörg Henkel, Mohammad Abdullah Al Faruque, Ru...
WWW
2007
ACM
14 years 9 months ago
Detectives: detecting coalition hit inflation attacks in advertising networks streams
Click fraud is jeopardizing the industry of Internet advertising. Internet advertising is crucial for the thriving of the entire Internet, since it allows producers to advertise t...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 9 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
DCC
2007
IEEE
14 years 8 months ago
Low-density attack revisited
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi ...