Results 1 - 10 of 4,334

New spectral methods for ratio cut partition and clustering

by Lars Hagen, Andrew B. Kahng - IEEE TRANS. ON COMPUTER-AIDED DESIGN , 1992
"... Partitioning of circuit netlists is important in many phases of VLSI design, ranging from layout to testing and hardware simulation. The ratio cut objective function [29] has received much attention since it naturally captures both min-cut and equipartition, the two traditional goals of partitionin ..."
Abstract - Cited by 296 (17 self) - Add to MetaCart
Partitioning of circuit netlists is important in many phases of VLSI design, ranging from layout to testing and hardware simulation. The ratio cut objective function [29] has received much attention since it naturally captures both min-cut and equipartition, the two traditional goals

The Determinants of Credit Spread Changes.

by Pierre Collin-Dufresne , Robert S Goldstein , J Spencer Martin , Gurdip Bakshi , Greg Bauer , Dave Brown , Francesca Carrieri , Peter Christoffersen , Susan Christoffersen , Greg Duffee , Darrell Duffie , Vihang Errunza , Gifford Fong , Mike Gallmeyer , Laurent Gauthier , Rick Green , John Griffin , Jean Helwege , Kris Jacobs , Chris Jones , Andrew Karolyi , Dilip Madan , David Mauer , Erwan Morellec , Federico Nardari , N R Prabhala , Tony Sanders , Sergei Sarkissian , Bill Schwert , Ken Singleton , Chester Spatt , René Stulz - Journal of Finance , 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract - Cited by 422 (2 self) - Add to MetaCart
the structural framework, default is triggered when the leverage ratio approaches unity. Hence, it is clear that credit spreads are expected to increase with leverage. Likewise, credit spreads should be a decreasing function of the firm's return on equity, all else equal. Changes in Volatility

Graph Cuts and Efficient N-D Image Segmentation

by Yuri Boykov, Gareth Funka-Lea , 2006
"... Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of graph-cuts: segmentation of objects in image data. Despite its simplicity, this application epitomizes the best features ..."
Abstract - Cited by 307 (7 self) - Add to MetaCart
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of graph-cuts: segmentation of objects in image data. Despite its simplicity, this application epitomizes the best features

Seam carving for content-aware image resizing

by Shai Avidan, Ariel Shamir - ACM Trans. Graph , 2007
"... Figure 1: A seam is a connected path of low energy pixels in an image. On the left is the original image with one horizontal and one vertical seam. In the middle the energy function used in this example is shown (the magnitude of the gradient), along with the vertical and horizontal path maps used t ..."
Abstract - Cited by 323 (11 self) - Add to MetaCart
image from top to bottom, or left to right, where optimality is defined by an image energy function. By repeatedly carving out or inserting seams in one direction we can change the aspect ratio of an image. By applying these operators in both directions we can retarget the image to a new size

Interactive Digital Photomontage

by Aseem Agarwala, Mira Dontcheva, Maneesh Agrawala, Steven Drucker, Alex Colburn, Brian Curless, David Salesin, Michael Cohen - ACM TRANS. GRAPH , 2004
"... We describe an interactive, computer-assisted framework for combining parts of a set of photographs into a single composite picture, a process we call "digital photomontage." Our framework makes use of two techniques primarily: graph-cut optimization, to choose good seams within the consti ..."
Abstract - Cited by 304 (17 self) - Add to MetaCart
variety of high-level image objectives, either globally across the image, or locally through a painting-style interface. Image objectives are applied independently at each pixel location and generally involve a function of the pixel values (such as "maximum contrast") drawn from that same

Joint Tx-Rx beamforming design for multicarrier MIMO channels: a unified framework for convex optimization

by Daniel Pérez Palomar, John M. Cioffi, Miguel Angel Lagunas - IEEE TRANS. SIGNAL PROCESSING , 2003
"... This paper addresses the joint design of transmit and receive beamforming or linear processing (commonly termed linear precoding at the transmitter and equalization at the receiver) for multicarrier multiple-input multiple-output (MIMO) channels under a variety of design criteria. Instead of consid ..."
Abstract - Cited by 297 (19 self) - Add to MetaCart
of considering each design criterion in a separate way, we generalize the existing results by developing a unified framework based on considering two families of objective functions that embrace most reasonable criteria to design a communication system: Schur-concave and Schur-convex functions. Once the optimal

A Min-max Cut Algorithm for Graph Partitioning and Data Clustering

by Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Ming Gu, Horst Simon , 2001
"... An important application of graph partitioning is data clustering using a graph model -- the pairwise similarities between all data objects form a weighted graph adjacency matrix that contains all necessary information for clustering. Here we propose a new algorithm for graph partition with an objec ..."
Abstract - Cited by 213 (15 self) - Add to MetaCart
with an objective function that follows the min-max clustering principle. The relaxed version of the optimization of the min-max cut objective function leads to the Fiedler vector in spectral graph partition. Theoretical analyses of min-max cut indicate that it leads to balanced partitions, and lower bonds

Genetic Algorithms, Noise, and the Sizing of Populations

by David E. Goldberg, Kalyanmoy Deb, James H. Clark - COMPLEX SYSTEMS , 1991
"... This paper considers the effect of stochasticity on the quality of convergence of genetic algorithms (GAs). In many problems, the variance of building-block fitness or so-called collateral noise is the major source of variance, and a population-sizing equation is derived to ensure that average sig ..."
Abstract - Cited by 276 (85 self) - Add to MetaCart
, and the explicit noise or nondeterminism of the objective function. In a test suite of five functions, the sizing relation proves to be a conservative predictor of average correct convergence, as long as all major sources of noise are considered in the sizing calculation. These results suggest how the sizing

Weighted graph cuts without eigenvectors: A multilevel approach

by Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis - IEEE TRANS. PATTERN ANAL. MACH. INTELL , 2007
"... A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods. In this paper, we discuss an equivalence between the objective functions used in these seemingly different methods—in par ..."
Abstract - Cited by 175 (22 self) - Add to MetaCart
—in particular, a general weighted kernel k-means objective is mathematically equivalent to a weighted graph clustering objective. We exploit this equivalence to develop a fast high-quality multilevel algorithm that directly optimizes various weighted graph clustering objectives, such as the popular ratio cut

Robust Higher Order Potentials for Enforcing Label Consistency

by P. Kohli, L. Ladický, P. H. S. Torr , 2009
"... This paper proposes a novel framework for labelling problems which is able to combine multiple segmentations in a principled manner. Our method is based on higher order conditional random fields and uses potentials defined on sets of pixels (image segments) generated using unsupervised segmentation ..."
Abstract - Cited by 259 (34 self) - Add to MetaCart
n Potts model recently proposed by Kohli et al. We prove that the optimal swap and expansion moves for energy functions composed of these potentials can be computed by solving a stmincut problem. This enables the use of powerful graph cut based move making algorithms for performing inference
Results 1 - 10 of 4,334