4212 search results - page 254 / 843 » On Compressible Pairings and Their Computation |
169
click to vote
FUIN
2010
15 years 5 months ago
2010
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
259
click to vote
Publication
Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival pr...
155
click to vote
AIED
2007
Springer
16 years 27 days ago
2007
Springer
We compare the relative utility of different automatically computable linguistic feature sets for modeling student learning in computer dialogue tutoring. We use the PARADISE frame...
172
click to vote
ICCAD
1996
IEEE
15 years 11 months ago
1996
IEEE
We give a denotational framework (a "meta model") within which certain properties of models of computation can be understood and compared. It describes concurrent proces...
184
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...