Sciweavers

36320 search results - page 96 / 7264
» From Code to Models
Sort
View
ASPLOS
2008
ACM
15 years 8 months ago
Dispersing proprietary applications as benchmarks through code mutation
Industry vendors hesitate to disseminate proprietary applications to academia and third party vendors. By consequence, the benchmarking process is typically driven by standardized...
Luk Van Ertvelde, Lieven Eeckhout
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 6 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin
SIGSOFT
2009
ACM
16 years 7 months ago
Learning from examples to improve code completion systems
The suggestions made by current IDE's code completion features are based exclusively on static type system of the programming language. As a result, often proposals are made ...
Marcel Bruch, Martin Monperrus, Mira Mezini
GLOBECOM
2009
IEEE
16 years 1 months ago
Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...
Daniel Enrique Lucani, Muriel Médard, Milic...
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
15 years 10 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...