Results 1  10
of
114
New spectral methods for ratio cut partition and clustering
 IEEE TRANS. ON COMPUTERAIDED 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 mincut and equipartition, the two traditional goals of partitionin ..."
Abstract

Cited by 296 (17 self)
 Add to MetaCart
of partitioning. In this paper, we show that the second smallest eigenvalue of a matrix derived from the netlist gives a provably good approximation of the optimal ratio cut partition cost. We also demonstrate that fast Lanczostype methods for the sparse symmetric eigenvalue problem are a robust basis
ORIGINAL PAPER Dynamics of targetmediated drug disposition: characteristic profiles and parameter identification
"... ysis of the basic model for target mediated drug disposition (TMDD). Assuming high affinity of ligand to target, we give a qualitative characterisation of ligand versus time graphs for different dosing regimes and derive accurate analytic approximations of different phases in the temporal behaviour ..."
Abstract
 Add to MetaCart
of the system. These approximations are used to estimate model parameters, give analytical approximations of such quantities as area under the ligand curve and clearance. We formulate conditions under which a suitably chosen Michaelis–Menten model provides a good approximation of the full TMDDmodel over a
INTERMEDIATE REDUCTION STEPS IMPROVE AUTOMATED MULTILEVEL SUBSTRUCTURING
"... The Automated MultiLevel Substructuring (AMLS) method has been developed to reduce the computational demands of frequency response analysis and has recently been proposed as an alternative to iterative projection methods like Lanczos or Jacobi– Davidson for computing a large number of eigenvalues f ..."
Abstract
 Add to MetaCart
for matrices of very large dimension. Based on Schur complements and modal approximations of submatrices on several levels AMLS constructs a projected eigenproblem which yields good approximations of eigenvalues at the lower end of the spectrum. In this paper we reduce the cost of AMLS introducing
RICHARDSON EXTRAPOLATION ON GENERALIZED SHISHKIN MESHES FOR SINGULARLY PERTURBED PROBLEMS
"... Abstract. In this work we are interested in to apply the Richardson extrapolation technique on a type of finite difference schemes, which are used to solve 1D singularly perturbed problems of convectiondiffusion type. The numerical method is constructed on generalized Shishkin meshes, which are de ..."
Abstract
 Add to MetaCart
are defined by using a generating function; in all cases the mesh points are condensed in the boundary layer region, in order to obtain a good approximation in the maximum norm. We prove that, if the diffusion coefficient is sufficiently small, an appropriate Richardson extrapolation increase the order
Soft Matter COMMUNICATION
"... tories and bubble surface interactions in the same system. Here we present a detailed study of a rising, mm size bubble in water colliding with a glass surface aer having reached terminal velocity. The bubble trajectory was tracked by high speed video. We also recorded synchronized videos of the int ..."
Abstract
 Add to MetaCart
of the interference fringes In our system, the surface tension force is dominant over the inertial force as indicated by a small Weber number, We 2RoVT 2r/s < 1 (see Fig. 1). Thus each bubble is, to a good approximation, a sphere with radius Ro. Here r 1000 kg m3 is the density and s 72mNm1 is the surface
Generalized Incremental Mechanisms for Scheduling Games
"... We study the problem of designing truthful mechanisms for cooperative cost sharing games that realize (approximate) budget balance and social cost. Recent negative results show that groupstrategyproof mechanisms can only achieve very poor approximation guarantees for several fundamental cost shari ..."
Abstract
 Add to MetaCart
that several primaldual approximation algorithms naturally give rise to such mechanisms with good approximation guarantees. In this paper, we provide a simple yet powerful approach that enables us to turn any ρapproximation algorithm into a ρbudget balanced acyclic mechanism. We demonstrate
Structural Similarity Based Image Quality Assessment
 Digital Video Image Quality and Perceptual Coding, Chap 7, 2005
"... It is widely believed that the statistical properties of the natural visual environment play a fundamental role in the evolution, development and adaptation of the human visual system (HVS). An important observation about natural image signals is that they are highly structured. By “structured sig ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
quality assessment is that the HVS is highly adapted to extract structural information from the visual field, and therefore a measurement of structural similarity (or distortion) should provide a good approximation to perceived image quality. In this chapter, we introduce structural similarity
A quaternion framework for color image smoothing and segmentation
, 2011
"... In this paper, we present feature/detail preserving models for color image smoothing and segmentation using the Hamiltonian quaternion framework. First, we introduce a novel quaternionic Gabor filter (QGF) which can combine the color channels and the orientations in the image plane. We show that th ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
that these filters are optimally localized both in the spatial and frequency domains and provide a good approximation to quaternionic quadrature filters. Using the QGFs, we extract the local orientation information in the color images. Second, in order to model this derived orientation information, we propose
Quantum Compiling
, 2001
"... A key assumption in quantum computation is the ability to efficiently generate arbitrary unitary operators to high precision. However, it is often more reasonable to assume that we are only able to implement a finite set of primitive gates, from which we need to efficiently generate good approximat ..."
Abstract
 Add to MetaCart
A key assumption in quantum computation is the ability to efficiently generate arbitrary unitary operators to high precision. However, it is often more reasonable to assume that we are only able to implement a finite set of primitive gates, from which we need to efficiently generate good approximations
AN IMMERSED BOUNDARY METHOD FOR FLOWS AROUND RECTANGULAR OBJECTS.
"... stability analysis, porous medium Abstract. A second{order accurate and highly ecient Immersed Boundary Method (IBM) is presented for simulating
ows along rectangular non{moving solid objects. In this method a rectangular object is placed on a staggered Cartesian grid such that its boundary coincid ..."
Abstract
 Add to MetaCart
is satised to a very good approximation. The accuracy of the IBM requires a pressure{correction method in which the correction pressure is small, which is accomplished by adding a fraction of the correction pressure to the pressure after every time step. It is shown that for the currently used second
Results 1  10
of
114