Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,674
XORs in the air: practical wireless network coding
- In Proc. ACM SIGCOMM
, 2006
"... This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our de ..."
Abstract
-
Cited by 548 (20 self)
- Add to MetaCart
This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our
Treadmarks: Shared memory computing on networks of workstations
- Computer
, 1996
"... TreadMarks supports parallel computing on networks of workstations by providing the application with a shared memory abstraction. Shared memory facilitates the transition from sequential to parallel programs. After identifying possible sources of parallelism in the code, most of the data structures ..."
Abstract
-
Cited by 487 (37 self)
- Add to MetaCart
TreadMarks supports parallel computing on networks of workstations by providing the application with a shared memory abstraction. Shared memory facilitates the transition from sequential to parallel programs. After identifying possible sources of parallelism in the code, most of the data structures
Data Compression Using Adaptive Coding and Partial String Matching
- IEEE TRANSACTIONS ON COMMUNICATIONS
, 1984
"... The recently developed technique of arithmetic coding, in conjunction with a Markov model of the source, is a powerful method of data compression in situations where a linear treatment is inappropriate. Adaptive coding allows the model to be constructed dynamically by both encoder and decoder during ..."
Abstract
-
Cited by 442 (20 self)
- Add to MetaCart
of the message is sent. This paper describes how the conflict can be resolved with partial string matching, and reports experimental results which show that mixed-case English text can be coded in as little as 2.2 bits/ character with no prior knowledge of the source.
Generalization in Reinforcement Learning: Successful Examples Using Sparse Coarse Coding
- Advances in Neural Information Processing Systems 8
, 1996
"... On large problems, reinforcement learning systems must use parameterized function approximators such as neural networks in order to generalize between similar situations and actions. In these cases there are no strong theoretical results on the accuracy of convergence, and computational results have ..."
Abstract
-
Cited by 433 (20 self)
- Add to MetaCart
have been mixed. In particular, Boyan and Moore reported at last year's meeting a series of negative results in attempting to apply dynamic programming together with function approximation to simple control problems with continuous state spaces. In this paper, we present positive results for all
Embracing wireless interference: Analog network coding
- in ACM SIGCOMM
, 2007
"... Traditionally, interference is considered harmful. Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the opposite approach; it encourages strategically picked senders to interfere. Instead of forwarding packets, r ..."
Abstract
-
Cited by 358 (10 self)
- Add to MetaCart
, routers forward the interfering signals. The destination leverages network-level information to cancel the interference and recover the signal destined to it. The result is analog network coding because it mixes signals not bits. So, what if wireless routers forward signals instead of packets
Mixed Logit with Repeated Choices: Households' Choices Of Appliance Efficiency Level
, 1997
"... : Mixed logit models, also called random-parameters or error-components logit, are a generalization of standard logit that do not exhibit the restrictive "independence from irrelevant alternatives" property and explicitly account for correlations in unobserved utility over repeated choices ..."
Abstract
-
Cited by 338 (10 self)
- Add to MetaCart
choices by each customer. Mixed logits are estimated for households' choices of appliances under utility-sponsored programs that offer rebates or loans on high-efficiency appliances. JEL Codes: C15, C23, C25, D12, L68, L94, Q40 2 Mixed Logit with Repeated Choices: Households' Choices
THE EMERGENCE OF AN UDMURT-RUSSIAN MIXED CODE: EVIDENCE FROM DISCOURSE MARKERS
"... Abstract. This paper deals with the emergence of a mixed language variety spoken by Udmurt-Russian bilinguals in the Russian republic of Udmurtia. Called Suro-Požo ‘mixed, mixture ’ by its speakers, this language code is characterised by variation in the use of Udmurt, Russian, double and hybrid dis ..."
Abstract
- Add to MetaCart
Abstract. This paper deals with the emergence of a mixed language variety spoken by Udmurt-Russian bilinguals in the Russian republic of Udmurtia. Called Suro-Požo ‘mixed, mixture ’ by its speakers, this language code is characterised by variation in the use of Udmurt, Russian, double and hybrid
Memory Efficient Software Synthesis with Mixed Coding Style from Dataflow Graph
"... Due to the limited amount of memory resources in embedded systems, minimizing the memory requirement is an important goal of software synthesis. This paper presents a set of techniques to reduce the code and data sizes for software synthesis from graphical DSP programs based on the synchronous data ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
Due to the limited amount of memory resources in embedded systems, minimizing the memory requirement is an important goal of software synthesis. This paper presents a set of techniques to reduce the code and data sizes for software synthesis from graphical DSP programs based on the synchronous
On Mixed Codes with Covering Radius 1 and Minimum Distance 2
"... Let R, S and T be finite sets with |R | = r, |S | = s and |T | = t. A code C ⊂ R × S × T with covering radius 1 and minimum distance 2 is closely connected to a certain generalized partial Latin rectangle. We present various constructions of such codes and some lower bounds on their minimal cardi ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Let R, S and T be finite sets with |R | = r, |S | = s and |T | = t. A code C ⊂ R × S × T with covering radius 1 and minimum distance 2 is closely connected to a certain generalized partial Latin rectangle. We present various constructions of such codes and some lower bounds on their minimal
Results 1 - 10
of
3,674
