2436 search results - page 179 / 488 » Comonadic Notions of Computation |
176
click to vote
PODS
2011
ACM
14 years 7 months ago
2011
ACM
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
134
click to vote
STOC
2010
ACM
16 years 1 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
129
click to vote
AINA
2006
IEEE
15 years 10 months ago
2006
IEEE
Pervasive computing is becoming a reality, thanks to advances in wireless networking and increased popularity of portable devices. Users of these devices will need support to deci...
147
click to vote
LISP
2008
15 years 4 months ago
2008
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
110
click to vote
ENTCS
2007
15 years 4 months ago
2007
The application scenarios envisioned for ‘global ubiquitous computing’ have unique requirements that are often incompatible with traditional security paradigms. One alternativ...