output
20032005
most citedThe minimal spanning tree and the upper box dimension

13 citations

5 papers

cs.AI2005

Fine-Grained Word Sense Disambiguation Based on Parallel Corpora, Word Alignment, Word Clustering and Aligned Wordnets

Dan Tufis, Radu Ion, Nancy Ide

The paper presents a method for word sense disambiguation based on parallel corpora. The method exploits recent advances in word alignment and word clustering based on automatic ex…

astro-ph20041 cited

Binary Evolution and Neutron Stars in Globular Clusters

Natalia Ivanova, John M. Fregeau, Frederic A. Rasio

We investigate the dynamical formation and evolution of binaries containing neutron stars in dense globular clusters. Our numerical simulations combine a simple Monte Carlo prescri…

astro-ph2004

Probing Kolmogorov turbulence beyond the Magellanic Clouds: The Power of Southern Hemisphere's largest optical telescope (11m), SALT

D. L. Block, B. G. Elmegreen, D. M. Elmegreen +1

The Hubble classification scheme of galaxies is based on blue-light appearance. Atlases reveal the rich variety of responses of the Population I component (`the mask') of gas and d…

math.CO200313 cited

The minimal spanning tree and the upper box dimension

Gady Kozma, Zvi Lotker, Gideon Stupp

We show that the alpha-weight of an MST over n points in a metric space with upper box dimension d has a bound independent of n if alpha is smaller than d and does not have one if…

cs.CG2003

Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve

Ilya Baran, Erik D. Demaine

We consider a general model for representing and manipulating parametric curves, in which a curve is specified by a black box mapping a parameter value between 0 and 1 to a point i…