Results 1  10
of
11,802
Mtree: An Efficient Access Method for Similarity Search in Metric Spaces
, 1997
"... A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract

Cited by 663 (38 self)
 Add to MetaCart
are reported, considering as th performance criteria th number of page I/O's and th number of distance computations. Th results demonstratethm th Mtree indeed extendsth domain of applicability beyond th traditional vector spaces, performs reasonably well inhE[94Kv#E44V[vh data spaces, and scales well
On the bursty evolution of Blogspace
, 2003
"... O)( 1 #$ #+&PQ+&,0,/RP 2 ":9:0/ +%&P &.F0, )& ;)S O)( 1 #$ #+&PQ+&,0,/RP 2 ":9:0/ +% # O,<&7& =1 P &7"U;(Z ;>A@CB;D,[\D]K,D?^_ B`Bba]@C>Ac >AG8H$^2d)@C]E 9='0,*+82 &e " & Q (T0 U;Ub%&7*',#$ %& :3 Q ..."
Abstract

Cited by 365 (8 self)
 Add to MetaCart
Q+ #$ f" L ;&Vg"L0 ,M' (Fhji_E KkI+H$^2D9" 0 O (` lV P gmA)fn i_E K/o3qpr%+N8%+*s&#$ V# t /M &U5u 7*wv x)y z{V&.+L U; P x)z}l P 3~10/)O&U; P)2 "; b" l P l*` 5)% U5u&0 =)7*& ( U; 2890033320 3 &U;r82 U; 3!j" L8%=+*b
An Approximate MaxFlow MinCut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms
, 1989
"... In this paper, we consider a multicommodity flow problem where for each pair of vertices, (u,v), we are required to sendf halfunits of commodity (uv) from u to v and f halfunits of commodity (vu) from v to u without violating capacity constraints. Our main result is an algorithm for performing th9 ..."
Abstract

Cited by 246 (12 self)
 Add to MetaCart
In this paper, we consider a multicommodity flow problem where for each pair of vertices, (u,v), we are required to sendf halfunits of commodity (uv) from u to v and f halfunits of commodity (vu) from v to u without violating capacity constraints. Our main result is an algorithm for performing th
Evaluation of a tetrazoliumbased semiautomated colorimetric assay: assessment of chemosensitivity testing
 Cancer Res
, 1987
"... Drug sensitivity assays were performed using a variation of a colori metrie [3{4,5dimethylthiazol2yl)2,5diphenyltetrazolium bromide (MTT)1 assay on V79, CHOAuxBl, CH"C5, NCIH460, and NCIH249 cell lines following optimization of experimental conditions for each cell line. Results from t ..."
Abstract

Cited by 215 (2 self)
 Add to MetaCart
Drug sensitivity assays were performed using a variation of a colori metrie [3{4,5dimethylthiazol2yl)2,5diphenyltetrazolium bromide (MTT)1 assay on V79, CHOAuxBl, CH"C5, NCIH460, and NCIH249 cell lines following optimization of experimental conditions for each cell line. Results from
Spectrophotometric quantitation of antioxidant capacity through the formation of a phosphomolybdenum complex: specific application to the determination of vitamin
 E,” Analytical Biochemistry
, 1999
"... A spectrophotometric method has been developed for the quantitative determination of antioxidant capacity. The assay is based on the reduction of Mo(VI)to Mo(V) by the sample analyte and the subsequent formation of a green phosphate/Mo(V) complex atacidic pH. The method has been optimized and charac ..."
Abstract

Cited by 211 (0 self)
 Add to MetaCart
A spectrophotometric method has been developed for the quantitative determination of antioxidant capacity. The assay is based on the reduction of Mo(VI)to Mo(V) by the sample analyte and the subsequent formation of a green phosphate/Mo(V) complex atacidic pH. The method has been optimized
Coleman to Mrs
 Letter. Walnut Grove Plantation Archives
, 1969
"... In an incomplete market it is usually impossible to eliminate the intrinsic risk of an option. In this case quadratic risk minimization is often used to determine a hedging strategy. However, it may be more natural to use piecewise linear risk minimization. We investigate hedging strategies using p ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of capital. The value of the portfolio for a selffinancing strategy is then given by A market is complete if any claim H is attainable, that is, there exists a selffinancing strategy with V M = H (a.s.). If the market is incomplete for instance, in the case of discrete hedging a claim is, in general, non
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
functions approximate the desired voxel shapes. Let i (r) denote an orthonormal set of ideal voxel shapes, e.g., box functions. The relation between ideal voxel shapes and encoding functions is described by the n C n K ϫ n V encoding matrix [11] There are many possible ways of approximating ideal voxels
Analysis of the Meter of Acoustic Musical Signals
 IEEE Trans. Speech and Audio Processing
, 2004
"... Ametho is decribed which analyzes the basic patterno beats in a pieceo music, the musical meter. The analysis isperfoVRm jofoV at three different time scales: at the atopo tatum pulse level, at the tactus pulse level which com{CfixVm8 to thetempo o a piece, and at the musicalme0LN level.Aco9@9R ..."
Abstract

Cited by 154 (15 self)
 Add to MetaCart
ToappeC in IEEE Trans. Spe0 h and Audio ProceLCY1 . 2004 IEEE. Pe rsonaluse of thismatefifiF ispeRfifiV0(V Howe ve ,peNfi10(VY to reNYNYY0 eNYNYY0 this mate0Dfi foradve1CC0(L or promotionalpurpose or for cre0YYR ne wcolle0(LC works for reNLR or r eR1fiL0( ution toseFNN s or lists, or to refi
Solving lowdensity subset sum problems
 in Proceedings of 24rd Annu. Symp. Foundations of comput. Sci
, 1983
"... Abstract. The subset sum problem is to decide whether or not the O1 integer programming problem C aixi = M, Vi,x,=O or 1, il has a solution, where the ai and M are given positive integers. This problem is NPcomplete, and the difficulty of solving it is the basis of publickey cryptosystems of kna ..."
Abstract

Cited by 124 (3 self)
 Add to MetaCart
, and then uses a lattice basis reduction algorithm due to A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovasz to attempt to find v. The performance of the proposed algorithm is analyzed. Let the density d of a subset sum problem be defined by d = n/log2(maxi ai). Then for “almost all ” problems of density d c 0
Geometry of cohomology support loci for local systems
 I. J. Algebraic Geom
, 1997
"... X will stand for a smooth projective variety over C throughout these notes. To simplify some statements, it will be convenient (but not essential) to also assume that (*) H 2 (X, Z) is torsion free. To fix notation recall: The Picard variety P ic 0 (X) is the set of line bundles with trivial first C ..."
Abstract

Cited by 117 (0 self)
 Add to MetaCart
Chern class (the Chern class can be taken H 2 (X, C), since we are assuming that H 2 (X, Z) is torsion free) This is an abelian variety of dimension q(X) = dim H 1 (X, OX). Green and Lazarsfeld have introduced the cohomology support loci S i (X) = {L ∈ P ic 0 (X)  H i (X, L) ̸ = 0} along
Results 1  10
of
11,802