Sciweavers

650 search results - page 103 / 130
» On Coalgebras over Algebras
Sort
View
EDM
2008
97views Data Mining» more  EDM 2008»
13 years 10 months ago
Using Item-type Performance Covariance to Improve the Skill Model of an Existing Tutor
Using data from an existing pre-algebra computer-based tutor, we analyzed the covariance of item-types with the goal of describing a more effective way to assign skill labels to it...
Philip I. Pavlik, Hao Cen, Lili Wu, Kenneth R. Koe...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 9 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
ENTCS
2007
168views more  ENTCS 2007»
13 years 8 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 3 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 3 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret