2835 search results - page 240 / 567 » Automatic Question Answering |
181
click to vote
ASM
2003
ASM
15 years 12 months ago
2003
ASM
The question raised in [15] is answered how to naturally dely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully refl...
134
click to vote
FQ
2003
Springer
15 years 11 months ago
2003
Springer
We construct a tower of function fields F0 ⊂ F1 ⊂ . . . over a finite field such that every place of every Fi ramifies in the tower and lim genus(Fi)/[Fi : F0] < ∞. We...
147
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
172
Voted
ISWC
2002
IEEE
15 years 11 months ago
2002
IEEE
Does the use of a wearable context-aware computer increase task proficiency? User trials have been carried out in an attempt to answer this question. The study involves WECAPC sof...
143
click to vote
FSE
2010
Springer
15 years 11 months ago
2010
Springer
We answer the question of Reyhanitabar et al. from FSE’09 of constructing a domain extension scheme for enhanced target collisionresistant (eTCR) hash functions with sublinear ke...