Sciweavers

336 search results - page 11 / 68
» Program Speedups in Theory and Practice
Sort
View
CPM
2007
Springer
99views Combinatorics» more  CPM 2007»
14 years 1 months ago
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
SYNASC
2008
IEEE
300views Algorithms» more  SYNASC 2008»
14 years 1 months ago
A Theory of Adaptable Contract-Based Service Composition
Service Oriented Architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a ...
Giovanni Bernardi, Michele Bugliesi, Damiano Maced...
SIGCSE
2006
ACM
119views Education» more  SIGCSE 2006»
14 years 1 months ago
Practice what you preach: full separation of concerns in CS1/CS2
We argue that the failure to separate the concerns in CS1 is the leading cause of difficulty in teaching OOP in the first year. We show how the concerns can be detangled and prese...
Hamzeh Roumani
APLAS
2008
ACM
13 years 9 months ago
JavaScript Instrumentation in Practice
JavaScript has been exploited to launch various browser-based attacks. Our previous work proposed a theoretical framework applying policy-based code instrumentation to JavaScript. ...
Haruka Kikuchi, Dachuan Yu, Ajay Chander, Hiroshi ...
DCC
2005
IEEE
14 years 7 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...