1321 search results - page 230 / 265 » Subtyping in Logical Form |
127
click to vote
LOGCOM
2010
15 years 2 months ago
2010
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation...
132
click to vote
MICS
2010
15 years 2 months ago
2010
Strategies specify how a wide range of exercises can be solved incrementally, such as bringing a logic proposition to disjunctive normal form, reducing a matrix, or calculating wit...
194
click to vote
VL
2010
IEEE
15 years 2 months ago
2010
IEEE
Many machine-learning algorithms learn rules of behavior from individual end users, such as taskoriented desktop organizers and handwriting recognizers. These rules form a “prog...
196
click to vote
CC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
174
click to vote
ASAP
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--This paper proposes an FPGA-based applicationspecific elliptic curve processor over a prime field. This research targets applications for which compactness is more import...