Results 11  20
of
352
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
complementary to Fourier preparation by linear field gradients. Thus, by using multiple receiver coils in parallel scan time in Fourier imaging can be considerably reduced. The problem of image reconstruction from sensitivity encoded data is formulated in a general fashion and solved for arbitrary coil
Edgecoloring partial ktrees,
 J. Algorithms
, 1996
"... Ž Many combinatorial problems can be efficiently solved for partial ktrees graphs . of treewidth bounded by k . The edgecoloring problem is one of the wellknown combinatorial problems for which no efficient algorithms were previously known, except a polynomialtime algorithm of very high complex ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
Ž Many combinatorial problems can be efficiently solved for partial ktrees graphs . of treewidth bounded by k . The edgecoloring problem is one of the wellknown combinatorial problems for which no efficient algorithms were previously known, except a polynomialtime algorithm of very high
Edge Coloring with Delays
"... Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on one side are the transmitters and the nodes on the other side are the receivers. The edges correspond to messages, and eve ..."
Abstract
 Add to MetaCart
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on one side are the transmitters and the nodes on the other side are the receivers. The edges correspond to messages
A polyhedral approach to edge coloring
, 1991
"... We formulate the edge coloring problem on a simple graph as the integer program of covering edges by matchings. For the NPhard case of 3regular graphs we show that it is sufficient to solve the linear programming relaxation with the additional constraints hat each odd circuit be covered by at leas ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We formulate the edge coloring problem on a simple graph as the integer program of covering edges by matchings. For the NPhard case of 3regular graphs we show that it is sufficient to solve the linear programming relaxation with the additional constraints hat each odd circuit be covered
Minimum cuts in nearlinear time
 Proc. of the 28th STOC
, 1996
"... Abstract. We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling techniques. We give a randomized (Monte Carl ..."
Abstract

Cited by 95 (12 self)
 Add to MetaCart
Carlo) algorithm that finds a minimum cut in an medge, nvertex graph with high probability in O(m log 3 n) time. We also give a simpler randomized algorithm that finds all minimum cuts with high probability in O(n 2 log n) time. This variant has an optimal ᏺᏯ parallelization. Both variants improve
A fast algoritm for computing a nearly . . .
, 2010
"... We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previous algorithms. The coloring computed by our algorithm satisfies additional balanced conditions on the number of edges us ..."
Abstract
 Add to MetaCart
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previous algorithms. The coloring computed by our algorithm satisfies additional balanced conditions on the number of edges
Supervised Random Walks: Predicting and Recommending Links in Social Networks
"... Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interactions among existing members are likely to occur in the near future or which existing interactions are we missing. Althoug ..."
Abstract

Cited by 147 (3 self)
 Add to MetaCart
. Although this problem has been extensively studied, the challenge of how to effectively combine the information from the network structure with rich node and edge attribute data remains largely open. We develop an algorithm based on Supervised Random Walks that naturally combines the information from
Efficient, EdgeAware, Combined Color Quantization and Dithering
"... Abstract—In this paper we present a novel algorithm to simultaneously accomplish color quantization and dithering of images. This is achieved by minimizing a perceptionbased cost function which considers pixelwise differences between filtered versions of the quantized image and the input image. We ..."
Abstract
 Add to MetaCart
. We use edge aware filters in defining the cost function to avoid mixing colors on opposite sides of an edge. The importance of each pixel is weighted according to its saliency. To rapidly minimize the cost function, we use a modified multiscale iterative conditional mode (ICM) algorithm which
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing
, 1997
"... . Motivated by the problem of efficient routing in alloptical networks, we study a constrained version of the bipartite edge coloring problem. We show that if the edges adjacent to a pair of opposite vertices of an Lregular bipartite graph are already colored with ffL different colors, then the re ..."
Abstract

Cited by 35 (15 self)
 Add to MetaCart
. Motivated by the problem of efficient routing in alloptical networks, we study a constrained version of the bipartite edge coloring problem. We show that if the edges adjacent to a pair of opposite vertices of an Lregular bipartite graph are already colored with ffL different colors
Finding equitable convex partitions of points in a polygon efficiently
 ACM Transactions on Algorithms
"... Abstract Previous work has developed algorithms for finding an equitable convex partition that partitions the plane into n convex pieces each containing an equal number of red and blue points. Motivated by a vehicle routing heuristic, we look at a related problem where each piece must contain one p ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Abstract Previous work has developed algorithms for finding an equitable convex partition that partitions the plane into n convex pieces each containing an equal number of red and blue points. Motivated by a vehicle routing heuristic, we look at a related problem where each piece must contain one
Results 11  20
of
352