MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "I Was a Computer." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

304 documents found, showing 1 through 10. Next 10 →

ATOM

Blauth, Pigeot: GraphFitI- A computer program for graphical chain
by Angelika Blauth, Iris Pigeot
…Blauth, Pigeot: GraphFitI - A computer program for graphical chain models Sonderforschungsbereich…
Add To MetaCart

"It / I": A Theater Play Featuring an Autonomous Computer Character
by Claudio S. Pinhanez, Aaron F. Bobick
…ABSTRACT “It / I” : A Theater Play Featuring an Autonomous Computer Character Claudio S. Pinhanez…
Cited by 12 (4 self) – Add To MetaCart

"It/I": A Theater Play Featuring an Autonomous Computer Graphics Character
by Claudio Pinhanez, Aaron Bobick — 1998 — Proc. of the ACM Multimedia'98 Workshop on Technologies for Interactive Movies
…'98) -- January 1998 "It/I": A Theater Play Featuring an Autonomous Computer Graphics Character…
Cited by 2 (0 self) – Add To MetaCart

Degree-Theoretic Aspects of Computably Enumerable Reals
by Cristian S. Calude, Cristian S. Calude, Richard Coles, Richard Coles, Peter H. Hertling, Peter H. Hertling, Bakhadyr Khoussainov, Bakhadyr Khoussainov — 1998 — in Models and Computability
… Khoussainov September 21, 1998 Abstract A real is computable if its left cut, L( ); is computable. If (qi)i…
Cited by 13 (0 self) – Add To MetaCart

The Topological Trace Formula
by Mark Goresky, Robert Macpherson — 2001 — Crelle’s Journal
… formula isa computation of the Lefschetz number of a Hecke correspondence C acting on the weighted…
Cited by 3 (3 self) – Add To MetaCart

Using Relative Refinement for Fault Tolerance
by Antonio Cau, Willem-Paul de Roever — 1993
… implementation level, which is shown to be a relative renement, i.e., correct for all computations in which…
Cited by 2 (0 self) – Add To MetaCart

Computable Invariance
by Vasco Brattka, Theoretische Informatik I, Fernuniversitat Hagen — 1996 — Theoretical Computer Science
…] and hence non-computable, i.e. there is no uniform algorithm which, given a program of a continuously…
Cited by 2 (1 self) – Add To MetaCart

On the Speed of Quantum Computation
by Tino Gramss, Tino Gramss Caltech — 1994
… computational state, i.e. a state which can arise during a computation, only one control bit set to one and so…
Cited by 1 (0 self) – Add To MetaCart

Using Computer Vision to Control a Reactive Computer Graphics . . .
by Claudio Pinhanez, Aaron Bobick — 1998 — In International Conference on Vision Systems
… play --- called It/I --- which featured, probably for the first time ever, a computer…
Cited by 1 (0 self) – Add To MetaCart

A rigid cone in the truth-table degrees with jump
by Bjørn Kjos-hanssen — 2004
… such that 1. t : ω → 2 is 0 ′′ -computable, 2. i is the characteristic function of a set I such that I ≤m y (3…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB