210 indexed results
The efficient implementation of collective communiction operations has received much attention. Initial efforts produced "optimal" trees based on network communication
The NIF Integrated Computer Control System (ICCS) application software uses a set of service frameworks that assures uniform behavior spanning
We prove that the join of two sets may actually fall into a lower level of the extended low hierarchy
We provide a characterization of those nonmonotonic inference operations C for which C(X) may be described as the set of
A quantum computer that can be constructed based on a superconducting nanocircuits has previously been proposed. We examine the effect
We study the corrections to adiabatic dynamics of two coupled quantum dot spin-qubits, each dot singly occupied with an electron,
We derive tight bounds on cache misses for evaluation of explicit stencil operators on structured grids. Our lower bound is
We give an elementary introduction to the notion of quantum entanglement between distinguishable parties and review a recent proposal about
In this paper we model several simple biochemical operations on RNA molecules that modify their secondary structure by means of
Applying the modular technology of developing of the problem-oriented extensions of a CAD system to a problem of automation of
We examine a 31P donor electron spin in a Si crystal to be used for the purposes of quantum computation.
A. Tarski proposed the study of infinitary consequence operations as the central topic of mathematical logic. He considered monotonicity to
Generalizations of numeration systems in which N is recognizable by a finite automaton are obtained by describing a lexicographically ordered
The low-energy behaviour of 2 coupled nanomagnets or 2 coupled SQUIDs, interacting with their environment, can be described by the
Given a completely positive (CP) map $T$, there is a theorem of the Radon-Nikodym type [W.B. Arveson, Acta Math. {\bf
Microsoft TerraServer displays aerial, satellite, and to-pographic images of the earth in a SQL database available via the Internet. It
Run II of the Tevatron Collider is reviewed, emphasizing operations through March 15, 2004. The Run II Luminosity Upgrade plans
Quantum theory can be formulated as a theory of operations, more specific, of complex represented operations from real Lie groups.
All the current modern encryption algorithms utilize fixed symbols for plaintext and cyphertext. What I mean by fixed is that
Constructor-Based Conditional Rewriting Logic is a general framework for integrating first-order functional and logic programming which gives an algebraic semantics
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix
We address the problem of detecting race conditions in programs that use semaphores for synchronization. Netzer and Miller showed that
A multi-hop synchronous wirelss network is said to be unknown if the nodes have no knowledge of the topology. A
Boolean functions can be used to express the groundness of, and trace grounding dependencies between, program variables in (constraint) logic