Results 1  10
of
964,433
OSCILLATING WINGAILERON COMBINATION IN TWODIMENSIONAL POTENTIAL FLOW
, 1952
"... The linearized theory for compressible unsteady flow is used, as suggested in recent contributions to the subject, to obtain the velocity potential and the lift and moment for a thin, harmonically oscillating, twodimensional wingaileron combination moving at sonic speed. The velocity potential is ..."
Abstract
 Add to MetaCart
The linearized theory for compressible unsteady flow is used, as suggested in recent contributions to the subject, to obtain the velocity potential and the lift and moment for a thin, harmonically oscillating, twodimensional wingaileron combination moving at sonic speed. The velocity potential
Steady advectiondiffusion around finite absorbers in twodimensional potential flows
, 2005
"... ..."
Nonstationary TwoDimensional Potential Flows by the Broadwell Model Equations
"... The twodimensional Broadwell model of discrete kinetic theory is studied in order to clarify the physical relevance of its solutions in comparison to the solutions of the continuous Boltzmann equation. This is achieved by determining completely, in closed form, all nonstationary potential flows wi ..."
Abstract
 Add to MetaCart
The twodimensional Broadwell model of discrete kinetic theory is studied in order to clarify the physical relevance of its solutions in comparison to the solutions of the continuous Boltzmann equation. This is achieved by determining completely, in closed form, all nonstationary potential flows
Snakes, Shapes, and Gradient Vector Flow
 IEEE TRANSACTIONS ON IMAGE PROCESSING
, 1998
"... Snakes, or active contours, are used extensively in computer vision and image processing applications, particularly to locate object boundaries. Problems associated with initialization and poor convergence to boundary concavities, however, have limited their utility. This paper presents a new extern ..."
Abstract

Cited by 755 (16 self)
 Add to MetaCart
in that it cannot be written as the negative gradient of a potential function, and the corresponding snake is formulated directly from a force balance condition rather than a variational formulation. Using several twodimensional (2D) examples and one threedimensional (3D) example, we show that GVF has a large
Token flow control
"... As companies move towards manycore chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scalability and increasing bandwidth demands, stateoftheart onchip networks use a modular packetswitched design with route ..."
Abstract

Cited by 635 (35 self)
 Add to MetaCart
with routers at every hop which allow sharing of network channels over multiple packet flows. This, however, leads to packets going through a complex router pipeline at every hop, resulting in the overall communication energy/delay being dominated by the router overhead, as opposed to just wire energy
Promoting the Use of EndtoEnd Congestion Control in the Internet
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1999
"... This paper considers the potentially negative impacts of an increasing deployment of noncongestioncontrolled besteffort traffic on the Internet.’ These negative impacts range from extreme unfairness against competing TCP traffic to the potential for congestion collapse. To promote the inclusion ..."
Abstract

Cited by 875 (14 self)
 Add to MetaCart
This paper considers the potentially negative impacts of an increasing deployment of noncongestioncontrolled besteffort traffic on the Internet.’ These negative impacts range from extreme unfairness against competing TCP traffic to the potential for congestion collapse. To promote the inclusion
The Contourlet Transform: An Efficient Directional Multiresolution Image Representation
 IEEE TRANSACTIONS ON IMAGE PROCESSING
"... The limitations of commonly used separable extensions of onedimensional transforms, such as the Fourier and wavelet transforms, in capturing the geometry of image edges are well known. In this paper, we pursue a “true” twodimensional transform that can capture the intrinsic geometrical structure t ..."
Abstract

Cited by 513 (20 self)
 Add to MetaCart
The limitations of commonly used separable extensions of onedimensional transforms, such as the Fourier and wavelet transforms, in capturing the geometry of image edges are well known. In this paper, we pursue a “true” twodimensional transform that can capture the intrinsic geometrical structure
Efficient Variants of the ICP Algorithm
 INTERNATIONAL CONFERENCE ON 3D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract

Cited by 718 (5 self)
 Add to MetaCart
sampling of the space of normals. We conclude by proposing a combination of ICP variants optimized for high speed. We demonstrate an implementation that is able to align two range images in a few tens of milliseconds, assuming a good initial guess. This capability has potential application to realtime 3D
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 1003 (8 self)
 Add to MetaCart
, the difficulty of their construction and their potential size have discouraged their use. We present new algorithms that efficiently compute these data structures for arbitrary control flow graphs. The algorithms use dominance frontiers, a new concept that may have other applications. We also give analytical
A Survey of Program Slicing Techniques
 JOURNAL OF PROGRAMMING LANGUAGES
, 1995
"... A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser in 197 ..."
Abstract

Cited by 790 (10 self)
 Add to MetaCart
A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser
Results 1  10
of
964,433