Sciweavers

9626 search results - page 1452 / 1926
» Invariant Based Programming
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 7 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
ICFP
2006
ACM
16 years 7 months ago
Delimited dynamic binding
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
MOBIHOC
2008
ACM
16 years 6 months ago
Improving sensor network immunity under worm attacks: a software diversity approach
Because of cost and resource constraints, sensor nodes do not have a complicated hardware architecture or operating system to protect program safety. Hence, the notorious buffer-o...
Yi Yang, Sencun Zhu, Guohong Cao
EUROSYS
2006
ACM
16 years 4 months ago
A quantitative analysis of aspects in the eCos kernel
Nearly ten years after its first presentation and five years after its first application to operating systems, the suitability of AspectOriented Programming (AOP) for the devel...
Daniel Lohmann, Fabian Scheler, Reinhard Tartler, ...
ASPLOS
2010
ACM
16 years 1 months ago
SherLog: error diagnosis by connecting clues from run-time logs
Computer systems often fail due to many factors such as software bugs or administrator errors. Diagnosing such production run failures is an important but challenging task since i...
Ding Yuan, Haohui Mai, Weiwei Xiong, Lin Tan, Yuan...
« Prev « First page 1452 / 1926 Last » Next »