Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,414
Convex Position Estimation in Wireless Sensor Networks
"... A method for estimating unknown node positions in a sensor network based exclusively on connectivity-induced constraints is described. Known peer-to-peer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem fo ..."
Abstract
-
Cited by 493 (0 self)
- Add to MetaCart
A method for estimating unknown node positions in a sensor network based exclusively on connectivity-induced constraints is described. Known peer-to-peer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem
Control under communication constraints
, 2004
"... There is an increasing interest in studying control systems employing multiple sensors and actuators that are geographically distributed. Communication is an important component of these distributed and networked control systems. Hence, there is a need to understand the interactions between the con ..."
Abstract
-
Cited by 350 (9 self)
- Add to MetaCart
the control components and the communication components of the distributed system. In this paper, we formulate a control problem with a communication channel connecting the sensor to the controller. Our task involves designing the channel encoder and channel decoder along with the controller to achieve
Nested Linear/Lattice Codes for Structured Multiterminal Binning
, 2002
"... Network information theory promises high gains over simple point-to-point communication techniques, at the cost of higher complexity. However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning sch ..."
Abstract
-
Cited by 345 (14 self)
- Add to MetaCart
proposed the idea of nested codes, or more specifically, nested parity-check codes for the binary case and nested lattices in the continuous case. These ideas connect network information theory with the rich areas of linear codes and lattice codes, and have strong potential for practical applications. We
Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality
- IEEE TRANS. ON INFORM. THEORY
, 2003
"... We characterize the sum capacity of the vector Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate four-way connection between the vector broadcast channel, the corresponding point-to-po ..."
Abstract
-
Cited by 323 (2 self)
- Add to MetaCart
We characterize the sum capacity of the vector Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate four-way connection between the vector broadcast channel, the corresponding point
3 A Tight Connection between Gamma-Ray Outbursts and Parsec-Scale Jet Activity in the Quasar 3C 454.3
"... ar ..."
Elastic bands: Connecting path planning and control
- In: Proceedings of the International conference on robotics and automation (ICRA
, 1993
"... Elastic bands are proposed as the basis for a new framework to close the gap between global path planning and real-time sensor-based robot control. An elastic band is a deformable collision-free path. The initial shape of the elastic is the free path generated by a planner. Subjected to artificial f ..."
Abstract
-
Cited by 199 (17 self)
- Add to MetaCart
providing a tight connection between the robot and its environment, the elastic band preserves the global nature of the planned path. This paper outlines the framework and discusses an efficient implementation based on bubbles. 1.
Free Bits, PCPs and Non-Approximability -- Towards Tight Results
, 1996
"... This paper continues the investigation of the connection between proof systems and approximation. The emphasis is on proving tight non-approximability results via consideration of measures like the "free bit complexity" and the "amortized free bit complexity" of proof systems. ..."
Abstract
-
Cited by 212 (39 self)
- Add to MetaCart
This paper continues the investigation of the connection between proof systems and approximation. The emphasis is on proving tight non-approximability results via consideration of measures like the "free bit complexity" and the "amortized free bit complexity" of proof systems.
High performance messaging on workstations: Illinois Fast Messages (FM) for Myrinet
- In Supercomputing
, 1995
"... In most computer systems, software overhead dominates the cost of messaging, reducing delivered performance, especially for short messages. Efficient software messaging layers are needed to deliver the hardware performance to the application level and to support tightly-coupled workstation clusters. ..."
Abstract
-
Cited by 311 (15 self)
- Add to MetaCart
In most computer systems, software overhead dominates the cost of messaging, reducing delivered performance, especially for short messages. Efficient software messaging layers are needed to deliver the hardware performance to the application level and to support tightly-coupled workstation clusters
CONNECTIVITY IN THE SET OF TIGHT FRAME
"... Abstract. We introduce new ideas to treat the problem of connectiv-ity of wavelets. We develop a method which produces intermediate paths of Tight Frame Wavelets (TFW). Using this method we prove that a large class of TFW-s, with only mild conditions on their spectrum, are arcwise connected. 1. ..."
Abstract
- Add to MetaCart
Abstract. We introduce new ideas to treat the problem of connectiv-ity of wavelets. We develop a method which produces intermediate paths of Tight Frame Wavelets (TFW). Using this method we prove that a large class of TFW-s, with only mild conditions on their spectrum, are arcwise connected. 1.
Results 1 - 10
of
2,414
