Sciweavers

1254 search results - page 43 / 251
» Making Hard Problems Harder
Sort
View
VIROLOGY
2010
179views more  VIROLOGY 2010»
13 years 6 months ago
Automatic binary deobfuscation
Abstract. This paper gives an overview of our research in the automation of the process of software protection analysis. We will focus more particularly on the problem of obfuscati...
Yoann Guillot, Alexandre Gazet
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 7 months ago
Statistical analysis of sketch estimators
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
Florin Rusu, Alin Dobra
CIC
2004
143views Communications» more  CIC 2004»
13 years 9 months ago
TCP Vegas-like Algorithm for Layered multicast Transmission
Layered multicast is probably the most elegant solution to tackle the heterogene ity problem in multicast delivery of real-time multimedia streams. However, the multiple join expe...
Omar Ait-Hellal, Guy Leduc
CORR
2006
Springer
140views Education» more  CORR 2006»
13 years 7 months ago
Nearly optimal exploration-exploitation decision thresholds
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
Christos Dimitrakakis
EMSOFT
2009
Springer
14 years 2 months ago
Implementing time-predictable load and store operations
Scratchpads have been widely proposed as an alternative to caches for embedded systems. Advantages of scratchpads include reduced energy consumption in comparison to a cache and a...
Jack Whitham, Neil C. Audsley