Sciweavers

1175 search results - page 171 / 235
» Abstract computability and algebraic specification
Sort
View
ASAP
2004
IEEE
126views Hardware» more  ASAP 2004»
14 years 18 days ago
Hyper-Programmable Architectures for Adaptable Networked Systems
We explain how modern programmable logic devices have capabilities that are well suited for them to assume a central role in the implementation of networked systems, now and in th...
Gordon J. Brebner, Philip James-Roxby, Eric Keller...
MSV
2007
13 years 10 months ago
FMC-QE: A New Approach in Quantitative Modeling
Abstract—Service requests are the origin of every service provisioning process and therefore the entities to be considered first. Similar to Physics and Engineering Sciences, ser...
Werner Zorn
CORR
2008
Springer
179views Education» more  CORR 2008»
13 years 9 months ago
Induction and Co-induction in Sequent Calculus
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
Alwen Tiu, Alberto Momigliano
ENTCS
2008
120views more  ENTCS 2008»
13 years 9 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
ECCV
2006
Springer
14 years 10 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady