Results 1  10
of
4,595
Sparse WiFi Deployment for Vehicular Internet Access with Bounded Interconnection Gap
"... Vehicular Internet access via open WLAN access points (AP) has been demonstrated to be a feasible solution to provide opportunistic data service to moving vehicles. Using an in situ deployment, however, such a solution does not provide worstcase performance guarantees due to unpredictable intermitt ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
coverage, which provides worstcase guarantees on the interconnection gap while using significantly fewer APs than needed for full coverage. We propose efficient algorithms to verify whether a given deployment provides αcoverage and approximation algorithms for determining an economic deployment of APs
Memory Consistency and Event Ordering in Scalable SharedMemory Multiprocessors
 In Proceedings of the 17th Annual International Symposium on Computer Architecture
, 1990
"... Scalable sharedmemory multiprocessors distribute memory among the processors and use scalable interconnection networks to provide high bandwidth and low latency communication. In addition, memory accesses are cached, buffered, and pipelined to bridge the gap between the slow shared memory and the f ..."
Abstract

Cited by 730 (17 self)
 Add to MetaCart
Scalable sharedmemory multiprocessors distribute memory among the processors and use scalable interconnection networks to provide high bandwidth and low latency communication. In addition, memory accesses are cached, buffered, and pipelined to bridge the gap between the slow shared memory
Hardness vs. randomness
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1994
"... We present a simple new construction of a pseudorandom bit generator, based on the constant depth generators of [N]. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (eg P, NC, PSPACE,...) using an arbitrary function tha ..."
Abstract

Cited by 298 (27 self)
 Add to MetaCart
that is hard for C. This construction reveals an equivalence between the problem of proving lower bounds and the problem of generating good pseudorandom sequences. Our construction has many consequences. The most direct one is that efficient deterministic simulation of randomized algorithms is possible under
Wireless Network Information Flow: A Deterministic Approach
, 2009
"... In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model, and ..."
Abstract

Cited by 296 (42 self)
 Add to MetaCart
information flow for the Gaussian wireless relay network. We present an achievable rate for general Gaussian relay networks and show that it is within a constant number of bits from the cutset bound on the capacity of these networks. This constant depends on the number of nodes in the network
Closing the gap in the capacity of wireless networks via percolation theory
 IEEE TRANS. INFORMATION THEORY
, 2007
"... An achievable bit rate per source–destination pair in a wireless network of � randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the same Ia � � transmission rate of arbitrari ..."
Abstract

Cited by 238 (8 self)
 Add to MetaCart
theory ensures that crossing paths form in the transition region between these two extreme scenarios. Nodes along these paths are used as a backbone, relaying data for other nodes, and can transport the total amount of information generated by all the sources. A lower bound on the achievable bit rate
Alpha Coverage: Bounding the Interconnection Gap for Vehicular Internet Access
, 2009
"... Abstract—Vehicular Internet access via open WLAN access points (APs) has been demonstrated to be a feasible solution to provide opportunistic data service to moving vehicles. Using an in situ deployment, however, such a solution does not provide worstcase performance guarantees due to unpredictable ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
coverage. We compare αcoverage with opportunistic access of open WLAN APs (modeled as a random deployment) via simulations over a realworld road network and show that using the same number of APs as random deployment, αcoverage bounds the interconnection gap to a much smaller distance than that in a random
Plenoptic sampling
 In SIGGRAPH
, 2000
"... This paper studies the problem of plenoptic sampling in imagebased rendering (IBR). From a spectral analysis of light field signals and using the sampling theorem, we mathematically derive the analytical functions to determine the minimum sampling rate for light field rendering. The spectral support ..."
Abstract

Cited by 249 (15 self)
 Add to MetaCart
support of a light field signal is bounded by the minimum and maximum depths only, no matter how complicated the spectral support might be because of depth variations in the scene. The minimum sampling rate for light field rendering is obtained by compacting the replicas of the spectral support
Robustness of simple monetary policy rules under model uncertainty
 MONETARY POLICY RULES
, 1999
"... In this paper, we investigate the properties of alternative monetary policy rules using four structural macroeconometric models: the FuhrerMoore model, Taylor’s MultiCountry Model, the MSR model of Orphanides and Wieland, and the FRB staff model. All four models incorporate the assumptions of rat ..."
Abstract

Cited by 240 (31 self)
 Add to MetaCart
to an upper bound on nominal interest rate volatility. Our analysis provides strong support for rules in which the firstdifference of the federal funds rate responds to the current output gap and the deviation of the oneyear average inflation rate from a specified target. In all four models, first
Signal delay in rc tree networks
 IEEE Transactions ComputerAided Design
, 1983
"... In MOS integrated circuits, signals may propagate between stages with fanout. The HOS interconnect may be modeled by an RC tree, Exact calculation of signal delay through such networks is difficult. However, upper and lower bounds for delay that are computationally simple are presented here. The res ..."
Abstract

Cited by 211 (3 self)
 Add to MetaCart
In MOS integrated circuits, signals may propagate between stages with fanout. The HOS interconnect may be modeled by an RC tree, Exact calculation of signal delay through such networks is difficult. However, upper and lower bounds for delay that are computationally simple are presented here
Approximate Graph Coloring by Semidefinite Programming.
 In Proceedings of 35th Annual IEEE Symposium on Foundations of Computer Science,
, 1994
"... Abstract. We consider the problem of coloring kcolorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm that colors a 3colorable graph on n vertices with min{O(⌬ 1/3 log 1/2 ⌬ log n), O(n 1/4 log 1/2 n)} colors where ⌬ is the maximum degree of any vertex ..."
Abstract

Cited by 210 (7 self)
 Add to MetaCart
relationship established between the value of the optimum solution to our semidefinite program and the Lovász function. We show lower bounds on the gap between the Permission to make digital / hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies
Results 1  10
of
4,595