Results 1  10
of
7,866
WideArea Traffic: The Failure of Poisson Modeling
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1995
"... Network arrivals are often modeled as Poisson processes for analytic simplicity, even though a number of traffic studies have shown that packet interarrivals are not exponentially distributed. We evaluate 24 widearea traces, investigating a number of widearea TCP arrival processes (session and con ..."
Abstract

Cited by 1775 (24 self)
 Add to MetaCart
Network arrivals are often modeled as Poisson processes for analytic simplicity, even though a number of traffic studies have shown that packet interarrivals are not exponentially distributed. We evaluate 24 widearea traces, investigating a number of widearea TCP arrival processes (session
NeXt generation/dynamic spectrum access/cognitive Radio Wireless Networks: A Survey
 COMPUTER NETWORKS JOURNAL (ELSEVIER
, 2006
"... Today's wireless networks are characterized by a fixed spectrum assignment policy. However, a large portion of the assigned spectrum is used sporadically and geographical variations in the utilization of assigned spectrum ranges from 15% to 85% with a high variance in time. The limited availabl ..."
Abstract

Cited by 746 (15 self)
 Add to MetaCart
Today's wireless networks are characterized by a fixed spectrum assignment policy. However, a large portion of the assigned spectrum is used sporadically and geographical variations in the utilization of assigned spectrum ranges from 15% to 85% with a high variance in time. The limited
The capacity of wireless networks
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2000
"... When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally p ..."
Abstract

Cited by 3243 (42 self)
 Add to MetaCart
When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally
Laplacian eigenmaps and spectral techniques for embedding and clustering.
 Proceeding of Neural Information Processing Systems,
, 2001
"... Abstract Drawing on the correspondence between the graph Laplacian, the LaplaceBeltrami op erator on a manifold , and the connections to the heat equation , we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded in ..."
Abstract

Cited by 668 (7 self)
 Add to MetaCart
in a higher dimensional space. The algorithm provides a computationally efficient approach to nonlinear dimensionality reduction that has locality preserving properties and a natural connection to clustering. Several applications are considered. In many areas of artificial intelligence, information
Facility Layout Problems with Fixed Areas and Variable Shapes:
"... The objective of the facility layout problem is to determine the placement of a group of departments within a facility in such a way that, over a given period, the total distance traveled by personnel or equipment is minimized. Unfortunately, many layout algorithms represent departments in a rather ..."
Abstract
 Add to MetaCart
for the green field case (Le., design a layout from scratch) in which this shortcoming is overcome. The heuristic allows departments of different area and free shape. Each department is represented as a group of connected cells. The fixed number of cells used in this representation is a measure for the user
It’s Not Factor Accumulation: Stylized Facts and Growth Models,” World Bank.
, 2001
"... Abstract: We document five stylized facts of economic growth. (1) The "residual" rather than factor accumulation accounts for most of the income and growth differences across nations. (2) Income diverges over the long run. (3) Factor accumulation is persistent while growth is not persiste ..."
Abstract

Cited by 427 (14 self)
 Add to MetaCart
is not persistent and the growth path of countries exhibits remarkable variation across countries. (4) Economic activity is highly concentrated, with all factors of production flowing to the richest areas. (5) National policies closely associated with longrun economic growth rates. We argue that these facts do
Channel Assignment Schemes for Cellular Mobile Telecommunication Systems
 IEEE Personal Communications
, 1996
"... This paper provides a detailed discussion of wireless resource and channel allocation schemes. We provide a survey of a large number of published papers in the area of fixed, dynamic and hybrid allocation schemes and compare their tradeoffs in terms of complexity and performance. We also investigat ..."
Abstract

Cited by 392 (1 self)
 Add to MetaCart
This paper provides a detailed discussion of wireless resource and channel allocation schemes. We provide a survey of a large number of published papers in the area of fixed, dynamic and hybrid allocation schemes and compare their tradeoffs in terms of complexity and performance. We also
Complexity of finding embeddings in a ktree
 SIAM JOURNAL OF DISCRETE MATHEMATICS
, 1987
"... A ktree is a graph that can be reduced to the kcomplete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a ktree. This problem is motivated by the existence of polynomial time al ..."
Abstract

Cited by 386 (1 self)
 Add to MetaCart
algorithms for many combinatorial problems on graphs when the graph is constrained to be a partial ktree for fixed k. These algorithms have practical applications in areas such as reliability, concurrent broadcasting and evaluation of queries in a relational database system. We determine the complexity
WingFuselage Intersection Lines and Fillet Inserts With FixedArea Constraint
"... Procedures for automatic computation of wingfuselage juncture geometry are described. These procedures begin with a geometry in wavedrag format. First, an intersection line is computed by extrapolating the wing to the fuselage. Then two types of lleting procedures are described, both of which utili ..."
Abstract
 Add to MetaCart
Procedures for automatic computation of wingfuselage juncture geometry are described. These procedures begin with a geometry in wavedrag format. First, an intersection line is computed by extrapolating the wing to the fuselage. Then two types of lleting procedures are described, both of which utilize a combination of analytical and numerical techniques appropriate for automatic calculation. An analytical technique for estimating the added volume due to the llet is derived, and an iterative procedure for revising the fuselage to compensate for this additional volume is given. Sample results are included in graphical form.
Multiuser OFDM with Adaptive Subcarrier, Bit, and Power Allocation
 IEEE JOURNAL ON SELECTED AREAS OF COMMUNICATIONS
, 1999
"... Multiuser orthogonal frequency division multiplexing (OFDM) with adaptive multiuser subcarrier allocation and adaptive modulation is considered. Assuming knowledge of the instantaneous channel gains for all users, we propose a multiuser OFDM subcarrier, bit, and power allocation algorithm to minimiz ..."
Abstract

Cited by 360 (3 self)
 Add to MetaCart
delay spread values and various numbers of users. The results show that our proposed algorithm outperforms multiuser OFDM systems with static timedivision multiple access (TDMA) or frequencydivision multiple access (FDMA) techniques which employ fixed and predetermined timeslot or subcarrier
Results 1  10
of
7,866