نتایج جستجو برای: 1960 to dey

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

Journal: :Victoria University of Wellington Law Review 2012

Journal: :Electronic Journal of Boundary Elements 2007

Journal: :Journal of Geographical Sciences 2015

2016
Bintou Ahmadou Ahidjo William R. Bishai

Mycobacterium tuberculosis (Mtb) is one of the most successful The failure to control the global TB epidemic despite the availability human pathogens, and a key mechanism in its virulence arsenal is its ability to influence host immune responses to its advantage. In recent years it has become clear that one such mechanism pivots on bacterial-derived, secreted small molecules that are released f...

2002
Aloke Dey Chung-yi Suen Ashish Das

Fractional factorial plans for asymmetric factorial experiments are obtained. These are shown to be universally optimal within the class of all plans involving the same number of runs under a model that includes the mean, all main effects and a specified set of two-factor interactions. Finite projective geometry is used to obtain such plans for experiments wherein the number of levels of each o...

2006
Tobias Lenz

This work generalizes the ideas in the NearestNeighbor-Crust algorithm by Dey and Kumar. It allows to reconstruct smooth closed curves from εsamples with ε ≤ 0.48 which is a big improvement compared to the original bound. Further generalization leads to a new algorithm which reconstructs arbitrary curves (open, closed, smooth, with corners, with intersections) in any dimension. The algorithm wo...

2016
Denzil Ferreira Vassilis Kostakos

In this section we provide an extensive summary of human sensors on the move, or mobile systems that are designed to collect data from smartphones that users carry in their everyday life. One can rely on people’s own mobile phones to collect data as they are at their close vicinity 90% of the time (Dey et al. 2011). These devices have immense potential to collect rich data about people’s behavi...

Journal: :CoRR 2013
Jiaji Zhou Stéphane Ross Yisong Yue Debadeepta Dey J. Andrew Bagnell

We study the problem of predicting a set or list of options under knapsack constraint. The quality of such lists are evaluated by a submodular reward function that measures both quality and diversity. Similar to DAgger (Ross et al., 2010), by a reduction to online learning, we show how to adapt two sequence prediction models to imitate greedy maximization under knapsack constraint problems: CON...

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

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