4581 search results - page 719 / 917 » Computing Transformation Semigroups |
201
click to vote
CSR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
176
click to vote
EUROSYS
2011
ACM
14 years 10 months ago
2011
ACM
We present an effective technique for crosschecking an IEEE 754 floating-point program and its SIMD-vectorized version, implemented in KLEE-FP, an extension to the KLEE symbolic ...
261
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
261
click to vote
RTA
2011
Springer
14 years 9 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
208
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Recent work on unsupervised feature learning has shown that learning on polynomial expansions of input patches, such as on pair-wise products of pixel intensities, can improve the...