8699 search results - page 298 / 1740 » Elements of the Theory of Computation |
163
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Let M = (A, <, P) where (A, <) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type or -, an...
117
click to vote
EUSFLAT
2007
15 years 8 months ago
2007
We consider the computation of multistate systems reliabilities in the presence of random set estimations for the elements' working abilities. It turns out that the Dempster-...
193
click to vote
CISC
2009
Springer
15 years 4 months ago
2009
Springer
In a selective private function evaluation (SPFE) protocol, the client privately computes some predefined function on his own input and on m out of server's n database element...
176
click to vote
CHI
2011
ACM
14 years 10 months ago
2011
ACM
We present Pinstripe, a textile user interface element for eyes-free, continuous value input on smart garments that uses pinching and rolling a piece of cloth between your finger...
166
click to vote
JCSS
2007
15 years 6 months ago
2007
We show that the elementary theory of the structure of the Solovay degrees of computably enumerable reals is undecidable.