Results 1 - 10
of
3,661
Next Century Challenges: Mobile Networking for “Smart Dust”
, 1999
"... Large-scale networks of wireless sensors are becoming an active topic of research. Advances in hardware technology and engineering design have led to dramatic reductions in size, power consumption and cost for digital circuitry, wire-less communications and Micro ElectroMechanical Systems (MEMS). Th ..."
Abstract
-
Cited by 625 (1 self)
- Add to MetaCart
the key elements of the emergent technology of “Smart Dust ” and outline the research challenges they present to the mobile networking and systems community, which must provide coherent connectivity to large numbers of mobile network nodes co-located within a small volume.
Routing Techniques in Wireless Sensor Networks: A Survey
- IEEE WIRELESS COMMUNICATIONS
, 2004
"... Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus, howeve ..."
Abstract
-
Cited by 741 (2 self)
- Add to MetaCart
Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus
The SGI Origin: A ccNUMA highly scalable server
- In Proceedings of the 24th International Symposium on Computer Architecture (ISCA’97
, 1997
"... The SGI Origin 2000 is a cache-coherent non-uniform memory access (ccNUMA) multiprocessor designed and manufactured by Silicon Graphics, Inc. The Origin system was designed from the ground up as a multiprocessor capable of scaling to both small and large processor counts without any bandwidth, laten ..."
Abstract
-
Cited by 497 (0 self)
- Add to MetaCart
, latency, or cost cliffs.The Origin system consists of up to 512 nodes interconnected by a scalable Craylink network. Each node consists of one or two RlOOOO processors, up to 4 GB of coherent memory, and a connection to a portion of the X I0 10 subsystem. This paper discusses the motivation for building
Coherent network interfaces for fine-grain communication
- In Proceedings of the 23rd Annual International Symposium on Computer Architecture
, 1996
"... Historically, processor accesses to memory-mapped device registers huve been marked uncachable to insure their visibili ~ to the device. The ubiquity of snooping cache coherence, howeveg makes it possible for processors and devices to interact with cachable, coherent memory operations. Using coheren ..."
Abstract
-
Cited by 61 (16 self)
- Add to MetaCart
coherence can improve performance by facilitating burst transfers of whole cache blocks and reducing control overheads (e. g., for polling). This paper begins an exploration of network inter-jtces (NIs) that use coherence—coherent network interfaces (CNIs)--to improve communication performance, We restrict
On the capacity of non-coherent network coding
, 2011
"... We consider the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized linear network coding operations on the source packets. We propose a channel model for the noncoherent network coding introduced by Koetter and ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
We consider the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized linear network coding operations on the source packets. We propose a channel model for the noncoherent network coding introduced by Koetter
On the Capacity of Non-Coherent Network Coding
, 2009
"... Abstract-The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N 2:: 1 receivers can also be achieved using packets of length log N bits, if the o ..."
Abstract
-
Cited by 7 (4 self)
- Add to MetaCart
Abstract-The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N 2:: 1 receivers can also be achieved using packets of length log N bits
The role of knowledge in discourse comprehension: A construction-integration model
- Psychological Review
, 1988
"... In contrast to expectation-based, predictive views of discourse comprehension, a model is developed in which the initial processing is strictly bottom-up. Word meanings are activated, propositions are formed, and inferences and elaborations are produced without regard to the discourse context. Howev ..."
Abstract
-
Cited by 476 (7 self)
- Add to MetaCart
. However, a network of interrelated items is created in this manner, which can be integrated into a coherent structure through a spreading activation process. Data concerning the time course of word identification in a discourse context are examined. A simulation of arithmetic word-problem under
On the capacity of multisource non-coherent network coding
- in Proc. of the IEEE Information Theory Workshop
, 2009
"... Abstract—We consider multisource non-coherent network cod-ing, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a “subspace” channel, that takes subspaces as inputs and outputs. We then show that the rate of each individual receiver is upper b ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
Abstract—We consider multisource non-coherent network cod-ing, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a “subspace” channel, that takes subspaces as inputs and outputs. We then show that the rate of each individual receiver is upper
Horus: A flexible group communication system
- Comm. of the ACM
, 1996
"... innovative system offering application developers an extensively flexible group communication model is described. The emergence of process-group environments for distributed computing represents a promising step toward robustness for mission-critical distributed applications. Process groups have a “ ..."
Abstract
-
Cited by 431 (28 self)
- Add to MetaCart
“natural’ ’ correspondence with data or services that have been replicated for availability or as part of a coherent cache. They can be used to support highly available security domains, and group mechanisms fit well with an emerging generation of intelligent network and collaborative work applications.
Variational algorithms for approximate Bayesian inference
, 2003
"... The Bayesian framework for machine learning allows for the incorporation of prior knowledge in a coherent way, avoids overfitting problems, and provides a principled basis for selecting between alternative models. Unfortunately the computations required are usually intractable. This thesis presents ..."
Abstract
-
Cited by 440 (9 self)
- Add to MetaCart
The Bayesian framework for machine learning allows for the incorporation of prior knowledge in a coherent way, avoids overfitting problems, and provides a principled basis for selecting between alternative models. Unfortunately the computations required are usually intractable. This thesis presents
Results 1 - 10
of
3,661