Results 1  10
of
18
A Nonparametric Approach to Noisy and Costly Optimization
, 2000
"... This paper describes PAIRWISE BISECTION: a nonparametric approach to optimizing a noisy function with few function evaluations. ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
This paper describes PAIRWISE BISECTION: a nonparametric approach to optimizing a noisy function with few function evaluations.
Manuscript Bisecting a FourConnected Graph with Three Resource Sets
"... Let G =(V,E) be an undirected graph with a node set V andanarcsetE. G has k pairwise disjoint subsets T1,T2,...,Tk of nodes, called resource sets, where Ti  is even for each i. The partition problem with k resource sets asks to find a partition V1 and V2 of the node set V such that the graphs indu ..."
Abstract
 Add to MetaCart
Let G =(V,E) be an undirected graph with a node set V andanarcsetE. G has k pairwise disjoint subsets T1,T2,...,Tk of nodes, called resource sets, where Ti  is even for each i. The partition problem with k resource sets asks to find a partition V1 and V2 of the node set V such that the graphs
Sparse flat neighborhood networks (sfnns): Scalable guaranteed pairwise bandwidth & unit latency
 In IPDPS
, 2005
"... Network performance for a particular application is determined by the latency and bisection bandwidth that are achieved for the set of specific communication patterns used by that application. The number of nodes with which each node might potentially communicate grows linearly as nodes are added, t ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Network performance for a particular application is determined by the latency and bisection bandwidth that are achieved for the set of specific communication patterns used by that application. The number of nodes with which each node might potentially communicate grows linearly as nodes are added
Nonparametric Optimization and Galactic Morphology
"... We also introduce a new algorithm for optimization of similaritybased data. In a problem where only the similarity metric is deo/ned, a gradient is rarely possible. The essence of MBR is the similarity metric among stored examples. The new algorithm, Pairwise Bisection, uses all pairs of stored exa ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We also introduce a new algorithm for optimization of similaritybased data. In a problem where only the similarity metric is deo/ned, a gradient is rarely possible. The essence of MBR is the similarity metric among stored examples. The new algorithm, Pairwise Bisection, uses all pairs of stored
Distance Constraints Solved Geometrically
 in Advances in Robot Kinematics
, 2004
"... Abstract Most geometric constraint problems can be reduced to give coordinates to a set of points from a subset of their pairwise distances. By exploiting this fact, this paper presents an algorithm that solves distance constraint systems by iteratively reducing and expanding the dimension of the pr ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract Most geometric constraint problems can be reduced to give coordinates to a set of points from a subset of their pairwise distances. By exploiting this fact, this paper presents an algorithm that solves distance constraint systems by iteratively reducing and expanding the dimension
Solving Geometric Constraints by Iterative Projections and Backprojections
"... Abstract — Most geometric constraint problems can be reduced to give coordinates to a set of points from a subset of their pairwise distances. By exploiting this fact, this paper presents an algorithm that solves geometric constraint systems by iteratively reducing and expanding the dimension of the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract — Most geometric constraint problems can be reduced to give coordinates to a set of points from a subset of their pairwise distances. By exploiting this fact, this paper presents an algorithm that solves geometric constraint systems by iteratively reducing and expanding the dimension
THE PHASE TRANSITION FOR DYADIC TILINGS
"... Abstract. Adyadictile ofordernis anyrectangleobtained from the unit square by n successive bisections by horizontal or vertical cuts. Let eachdyadictile ofordernbe availablewith probabilityp, independently of the others. We prove that for p sufficiently close to 1, there exists a set of pairwise dis ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Adyadictile ofordernis anyrectangleobtained from the unit square by n successive bisections by horizontal or vertical cuts. Let eachdyadictile ofordernbe availablewith probabilityp, independently of the others. We prove that for p sufficiently close to 1, there exists a set of pairwise
On GraphBased Symmetric Clusters with SingleSwitch Latency
"... Cluster computing is now an accepted form of supercomputing. A cluster is a collection of computer (node) interconnected by a highspeed network. Each cluster node is either a workstation, a personal computer (PC), or a symmetric multiprocessor (SMP). The performance of a cluster system depends main ..."
Linear precoding for multipair twoway MIMO relay systems with maxmin fairness
 IEEE Trans. Signal Process
, 2012
"... Abstract—Twoway relaying has demonstrated significant gain in spectral efficiency by applying network coding when a pair of source nodes exchange information via a relay node. This paper is concerned with the scenario where multiple pairs of users exchange information through a common relay node e ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
problem into a series of semidefinite programming problems using bisection search and certain transformation techniques. A quasioptimal solution is then obtained by using semidefinite relaxation (SDR). To reduce the design complexity, we further introduce a pairwise zeroforcing (ZF) struc
Dynamic Load Balancing using a Highly Concurrent Shared Data Type
, 1996
"... A standard scalable parallel architecture is now emerging: A set of processor/memory pairs access a pointtopoint network router which provides uniform remote access latencies. Hardware scalability is achieved through the additional memory bandwidth and the use of high performance switches offering ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
offering linear increases in bisection bandwidth. The issue of software scalability is problemspecific, however, a large class of algorithms exist which use divideandconquer techniques to exploit parallelism. Two of the main factors effecting the scalability of such algorithms are the exploitation
Results 1  10
of
18