1308 search results - page 2 / 262 » Let's Have a Conversation |
CHI
2006
ACM
14 years 10 months ago
2006
ACM
We present a prototype of the Minnesang exhibit that translates visitors' utterances into medieval German in their own voice. This lets visitors experience how they would hav...
GC
2010
Springer
13 years 7 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
HASKELL
2007
ACM
14 years 1 months ago
2007
ACM
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
MFCS
2005
Springer
14 years 3 months ago
2005
Springer
Let β be a real number with 1 < β < 2. We prove that the language of the β-shift is ∆0 n iff β is a ∆n-real. The special case where n is 1 is the independently inter...
DM
2008
13 years 9 months ago
2008
Let G be the set that contains precisely the graphs on n vertices with maximum degree 3 for which there exists a 4-cycle system of their complement in Kn. In this paper G is compl...