Results 1  10
of
7,855
Parallel Algorithms for Connected Domination Problem on Interval and Circulararc Graphs
"... Abstract: A connected domination set of a graph is a set of vertices such that every vertex not in is adjacent to and the induced subgraph of is connected. The minimum connected domination set of a graph is the connected domination set with the minimum number of vertices. In this paper, we propo ..."
Abstract
 Add to MetaCart
propose parallel algorithms for finding the minimum connected domination set of interval graphs and circulararc graphs. Our algorithms run in time algorithm using processors while the intervals and arcs are given in sorted order. Our algorithms are on the EREW PRAM model.
Some Optimal Parallel Algorithms on Interval and Circulararc Graphs *
"... In this paper, we consider some shortest path related problems on interval and circulararc graphs. For the allpair shortest path query problem on interval and circulararc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix and ..."
Abstract
 Add to MetaCart
In this paper, we consider some shortest path related problems on interval and circulararc graphs. For the allpair shortest path query problem on interval and circulararc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
k Best Cuts for CircularArc Graphs
, 1997
"... Given a set of n nonnegative weighted circulararcs on a unit circle, and an integer k, the k Best Cuts for CircularArcs problem, abbreviated as kBCCA problem, is to find a placement of k points, called cuts, on the circle such that the total weight of the arcs that contain at least one cut is ma ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
be improved to O(n). Based on these results, we then show that the kBCCA problem can be solved in O(I(k; n) + n log n) time, where I(k; n) is the time complexity of the kBCI problem. As a byproduct, the k Maximum Cliques Cover problem, (k ? 1) for the circulararc graphs can be solved in O(I(k; n) + n
Some Optimal Parallel Algorithms for Shortest Path Related Problems on Interval and Circulararc Graphs
 PROC. OF THE 19TH WORKSHOP ON COMBINATORIAL MATHEMATICS AND COMPUTATION THEORY
"... In this paper, we consider some shortest path related problems on interval and circulararc graphs. For the allpair shortest path query problem on interval and circulararc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix and ..."
Abstract
 Add to MetaCart
In this paper, we consider some shortest path related problems on interval and circulararc graphs. For the allpair shortest path query problem on interval and circulararc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix
Buffer Allocation in Regular Dataflow Networks: An Approach Based on Coloring CircularArc Graphs
"... In this paper we discuss a method to perform compiletime buffer allocation, allowing efficient buffer sharing among the arcs of a special form of dataflow graphs  known as regular stream flow graphs  commonly used in Digital Signal Processing applications. We relate the buffer sharing problem t ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In this paper we discuss a method to perform compiletime buffer allocation, allowing efficient buffer sharing among the arcs of a special form of dataflow graphs  known as regular stream flow graphs  commonly used in Digital Signal Processing applications. We relate the buffer sharing problem
Radar Interferometry and its application to changes in the Earth’s surface." Reviews of Geophysics 36(4
, 1998
"... Abstract. Geophysical applications of radar interferometry to measure changes in the Earth’s surface have exploded in the early 1990s. This new geodetic technique calculates the interference pattern caused by the difference in phase between two images acquired by a spaceborne synthetic aperture rad ..."
Abstract

Cited by 286 (5 self)
 Add to MetaCart
Abstract. Geophysical applications of radar interferometry to measure changes in the Earth’s surface have exploded in the early 1990s. This new geodetic technique calculates the interference pattern caused by the difference in phase between two images acquired by a spaceborne synthetic aperture radar at two distinct times. The resulting interferogram is a contour map of the change in distance between the ground and the radar instrument. These maps provide an unsurpassed spatial sampling density (;100 pixels km22), a competitive precision (;1 cm), and a useful observation cadence (1 pass month21). They record movements in the crust, perturbations in the atmosphere, dielectric modifications in the soil, and relief in the topography. They are also sensitive to technical effects, such as relative variations in the
3D Sound for Virtual Reality and Multimedia
, 2000
"... This paper gives HRTF magnitude data in numerical form for 43 frequencies between 0.212 kHz, the average of 12 studies representing 100 different subjects. However, no phase data is included in the tables; group delay simulation would need to be included in order to account for ITD. In 3D sound ..."
Abstract

Cited by 282 (5 self)
 Add to MetaCart
This paper gives HRTF magnitude data in numerical form for 43 frequencies between 0.212 kHz, the average of 12 studies representing 100 different subjects. However, no phase data is included in the tables; group delay simulation would need to be included in order to account for ITD. In 3D sound applications intended for many users, we want might want to use HRTFs that represent the common features of a number of individuals. But another approach might be to use the features of a person who has desirable HRTFs, based on some criteria. (One can sense a future 3D sound system where the pinnae of various famous musicians are simulated.) A set of HRTFs from a good localizer (discussed in Chapter 2) could be used if the criterion were localization performance. If the localization ability of the person is relatively accurate or more accurate than average, it might be reasonable to use these HRTF measurements for other individuals. The Convolvotron 3D audio system (Wenzel, Wightman, and Foster, 1988) has used such sets particularly because elevation accuracy is affected negatively when listening through a bad localizers ears (see Wenzel, et al., 1988). It is best when any single nonindividualized HRTF set is psychoacoustically validated using a 113 statistical sample of the intended user population, as shown in Chapter 2. Otherwise, the use of one HRTF set over another is a purely subjective judgment based on criteria other than localization performance. The technique used by Wightman and Kistler (1989a) exemplifies a laboratorybased HRTF measurement procedure where accuracy and replicability of results were deemed crucial. A comparison of their techniques with those described in Blauert (1983), Shaw (1974), Mehrgardt and Mellert (1977), Middlebrooks, Makous, and Gree...
Results 1  10
of
7,855