نتایج جستجو برای: nicely distance

تعداد نتایج: 241424  

2005
Carsten Stolz Maximilian Viermetz Michal Skubacz Ralph Neuneier

The design and organization of a website reflects the authors intent. Since user perception and understanding of websites may differ from the authors, we propose a means to identify and quantify this difference in perception. In our approach we extract perceived semantic focus by analyzing user behavior in conjunction with keyword similarity. By combining usage and content data we identify user...

2006
Andrew Lovitt Jont B. Allen

Portions of the procedure and analysis of the wide-band noise masking experiment in Miller-Nicely’s 1955 JASA paper (MN55) was repeated and a new set of data was collected in 2005. This classic paper is a commonly referenced work in which confusion matrices were collected for a set of consonant-vowels (CVs). From an analysis of the original results, they made conclusions about the robustness of...

Journal: :The astrophysical journal 2022

Abstract Current cosmological observations point to a serious discrepancy between the observed Hubble parameter obtained using direct versus cosmic microwave background radiation measurements. Besides this so-called Hubble–Lemaître tension, we also find considerable evidence in diverse observables that indicate violation of principle. In paper, suggest both these discrepancies are related and c...

Journal: :IEEE Trans. Information Theory 2002
Venkatesan Guruswami Johan Håstad Madhu Sudan David Zuckerman

Informally, an error-correcting code has “nice” listdecodability properties if every Hamming ball of “large” radius has a “small” number of codewords in it. Here, we report linear codes with non-trivial list-decodability: i.e., codes of large rate that are nicely listdecodable, and codes of large distance that are not nicely list-decodable. Specifically, on the positive side, we show that there...

Journal: :Journal of Fourier Analysis and Applications 2021

Given a graph $$G=(V,E)$$ , suppose we are interested in selecting sequence of vertices $$(x_j)_{j=1}^n$$ such that $$\left\{ x_1, \dots x_k\right\} $$ is ‘well-distributed’ uniformly k. We describe greedy algorithm motivated by potential theory and corresponding developments the continuous setting. The performs nicely on graphs may be use for sampling problems. can interpret as trying to gr...

Journal: :Proceedings of the American Mathematical Society 2001

Journal: :The Journal of the Acoustical Society of America 1971

Journal: :Physical review. E, Statistical, nonlinear, and soft matter physics 2007
Bart Vorselaars Alexey V Lyulin K Karatasos M A J Michels

A model based on a single Brownian particle moving in a periodic effective field is used to understand the non-Gaussian dynamics in glassy systems of cage escape and subsequent recaging, often thought to be caused by a heterogeneous glass structure. The results are compared to molecular-dynamics simulations of systems with varying complexity: quasi-two-dimensional colloidlike particles, atactic...

2013
Robert Bredereck Jiehua Chen Gerhard J. Woeginger

We investigate the problem of deciding whether a given preference profile is close to having a certain nice structure, as for instance single-peaked, single-caved, singlecrossing, value-restricted, best-restricted, worst-restricted, medium-restricted, or groupseparable profiles. We measure this distance by the number of voters or alternatives that have to be deleted to make the profile a nicely...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید