Sciweavers

277 search results - page 47 / 56
» From Reversible to Irreversible Computations
Sort
View
DAC
2007
ACM
14 years 8 months ago
Trusted Hardware: Can It Be Trustworthy?
Processing and storage of confidential or critical information is an every day occurrence in computing systems. The trustworthiness of computing devices has become an important co...
Cynthia E. Irvine, Karl N. Levitt
TCS
2011
13 years 2 months ago
Communication complexity and intrinsic universality in cellular automata
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rap...
WCRE
2005
IEEE
14 years 28 days ago
When Functions Change Their Names: Automatic Detection of Origin Relationships
It is a common understanding that identifying the same entity such as module, file, and function between revisions is important for software evolution related analysis. Most softw...
Sunghun Kim, Kai Pan, E. James Whitehead Jr.
HRI
2006
ACM
14 years 1 months ago
Using context and sensory data to learn first and second person pronouns
We present a method of grounded word learning that is powerful enough to learn the meanings of first and second person pronouns. The model uses the understood words in an utteran...
Kevin Gold, Brian Scassellati
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
13 years 11 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill