Sciweavers

4356 search results - page 549 / 872
» Communicating Transactions - (Extended Abstract)
Sort
View
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
15 years 5 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
DMIN
2009
180views Data Mining» more  DMIN 2009»
15 years 4 months ago
APHID: A Practical Architecture for High-Performance, Privacy-Preserving Data Mining
While the emerging field of privacy preserving data mining (PPDM) will enable many new data mining applications, it suffers from several practical difficulties. PPDM algorithms are...
Jimmy Secretan, Anna Koufakou, Michael Georgiopoul...
INFORMATICALT
2010
134views more  INFORMATICALT 2010»
15 years 4 months ago
Observability of Turing Machines: A Refinement of the Theory of Computation
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
Yaroslav D. Sergeyev, Alfredo Garro
CORR
2010
Springer
106views Education» more  CORR 2010»
15 years 3 months ago
Optimal measures and transition kernels
Abstract. We study positive measures that are solutions to an abstract optimisation problem, which is a generalisation of a classical variational problem with a constraint on infor...
Roman V. Belavkin
TVLSI
2011
265views more  TVLSI 2011»
15 years 1 months ago
Decoding-Aware Compression of FPGA Bitstreams
Abstract—Bitstream compression is important in reconfigurable system design since it reduces the bitstream size and the memory requirement. It also improves the communication ba...
Xiaoke Qin, Chetan Muthry, Prabhat Mishra