نتایج جستجو برای: bin size

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

Journal: :SIAM J. Comput. 1993
Gábor Galambos Gerhard J. Woeginger

case performance bounds for simple one-dimensional packing algorithms. SIAM J. A better algorithm for an ancient scheduling problem. Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. A new algorithm for on-line bin-packing. 44 43] G. Galambos and J. B. G. Frenk. A simple proof of Liang's lower bound for on-line bin packing and the extension to the ...

2014
Andre C. Linnenbank Jacques M. T. de Bakker Ruben Coronel

To estimate conduction velocities from activation times in myocardial tissue, the "average vector" method computes all the local activation directions and velocities from local activation times and estimates the fastest and slowest propagation speed from these local values. The "single vector" method uses areas of apparent uniform elliptical spread of activation and chooses a single vector for ...

2007
Inhee Chung James B. Witkoskie John P. Zimmer Jianshu Cao Moungi G. Bawendi

We estimate the number of CdSe quantum dots QDs in a microenvironment by analyzing the intensity fluctuation of the fluorescence time trace from a collection of QDs in the fluorescence intensity steady-state regime. The steady state is chosen because the aged blinking dynamics of single QDs leads to a higher probability for observing large on and off waiting times relative to the typical time b...

2004
Marc Demange Jérôme Monnot Vangelis Th. Paschos

We analyze the approximation behavior of some of the best-known polynomial-time approximation algorithms for bin-packing under an approximation criterion, called differential ratio, informally the ratio (n − λ(I))/(n − β(I)), where n is the size of the input list, λ(I) is the size of the solution provided by an approximation algorithm and β(I) is the size of the optimal one. This measure has or...

2015
Chuan Xue Blerta Shtylla Anthony Brown

To calculate the RDF, for each time frame we used the centers of the neurofilaments in the domain [−0.2μm, 0.2μm] × [−0.2μm, 0.2μm] as reference points. We chose to use reference points in a smaller domain in order to avoid boundary effects. For each reference point we binned the center-to-center distances (r) between the reference neurofilament and all other neurofilaments with a bin size ∆r =...

Journal: :IEEE Trans. Vehicular Technology 2000
Pete Bernardin Kanagalu Manoj

With the trend of cellular providers shifting to higher frequencies, there is an increasing migration to smaller cells that is further driven by the growing demand for wireless Internet service. This obviously calls for higher resolution Radio Frequency (RF) validation and prediction. Yet, to our knowledge, there has been no study as to what resolution is required for accurate RF modeling and p...

Journal: :CoRR 2018
Malvika Singh

Speech coding forms a crucial element in speech communications. An important area concerning it lies in feature extraction which can be used for analyzing Hindustani Classical Music. An important feature in this respect is the fundamental frequency often referred to as the pitch. In this work, the terms pitch and its acoustical sensation, the frequency is used interchangeably. There exists nume...

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

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