نتایج جستجو برای: block and path

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

2014
Travis Mayberry Erik-Oliver Blass Agnes Hui Chan

Recent research results on tree-based Oblivious RAM by Shi et al. [15] obtain communication complexity of O(l · log(N)) in the worst-case for an N -capacity storage with blocks size l. The individual nodes in the tree, however, are constructed using traditional ORAMs which have worst-case communication complexity linear in their capacity and block size. PIR protocols are able to provide better ...

Journal: :کشاورزی (منتشر نمی شود) 0
الیاس نیستانی عضو هیئت علمی ایستگاه تحقیقات دیم شمال خراسان، خراسان - ایران‏ علی‎ ‎اکبر محمودی عضو هیئت علمی ایستگاه تحقیقات دیم شمال خراسان، خراسان - ایران‏ فاطمه رحیم نیا کارشناسی ارشد اصلاح نباتات، دانشکده کشاورزی، دانشگاه آزاد اسلامی بروجرد، لرستان - ایران‏

this experiment was conducted using a randomized complete block design with three ‎replications with 10 barley cultivars in dryland research station of northern khorasan (shirvan) ‎in 2004-2005 growing season. results indicated that there was significant differences among the ‎lines in terms of the stand percentage, days to emergence, days to heading, days to maturity, plant ‎height, number of ...

Journal: :iran agricultural research 2016
r. naderi h. ghadiri m. edalat

management of nitrogen fertilization in crops is one of the most important components of integrated weed management. a two-year field experiment was conducted to determine the direct effects of wild mustard aboveground biomass and n content of wild mustard on oilseed rape yield. a set of factorial treatments was arranged in a randomized complete block design with four replications. treatments w...

2012
Azali Saudi Jumat Sulaiman

This paper proposed a behaviour-based paradigm approach known as Laplacian Behaviour-Based Control (LBBC) for solving path planning problem for a mobile robot operating in a structured indoor environment. LBBC relies on the use of Laplace’s Equation to model the potential function in the environment model. For solving the Laplace’s Equation, a numerical technique using a weighted block techniqu...

2013
Maurizio Patrignani

Universita’ di Roma Tre 3.1 Properties and Characterizations of Planar Graphs . . . . . 2 Basic Definitions • Properties • Characterizations 3.2 Planarity Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.3 History of Planarity Algorithms. . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.4 Common Algorithmic Techniques and Tools . . . . . ...

Journal: :پژوهش های زراعی ایران 0

in order to investigate the indices of drought tolerance, correlation coefficient and path analysis at deficit irrigation and nitrogen experiment, this experiment was conducted as split plot arranged in a randomized complete block design (rcbd) with three replications during 2000-2003 for wheat at maragheh agricultural research station of dari. the treatments were included four levels of defici...

1997
Guido M. Schuster Aggelos K. Katsaggelos

We propose a fast and e cient algorithm which nds the optimal quad-tree (QT) decomposition with leaf dependencies in the rate distortion sense. The underlying problem is the encoding of an image by a variable block size scheme, where the block size is encoded using a QT, each block is encoded by one of the admissible quantizers and the quantizers are transmitted using a rst order di erential pu...

2014
Emil Stefanov Marten van Dijk Elaine Shi Christopher Fletcher Ling Ren Xiangyao Yu Hubert Chan Srinivas Devadas

We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme known to date with small client storage. We formally prove that Path ORAM has a O(logN) bandwidth cost for blocks of size B = Ω(logN) bits. For such block sizes, Path ORAM is asymptotically better than the best known OR...

Journal: :Discussiones Mathematicae Graph Theory 2014
Hajo Broersma Binlong Li Shenggui Zhang

A graph is called traceable if it contains a Hamilton path, i.e., a pathcontaining all its vertices. Let G be a graph on n vertices. We say that aninduced subgraph of G is o−1-heavy if it contains two nonadjacent verticeswhich satisfy an Ore-type degree condition for traceability, i.e., with degreesum at least n−1 in G. A block-chain is a graph whose block graph is a path,<l...

1995
Olivier Danvy Ulrik P. Schultz

Lambda-lifting a functional program transforms it into a set of recursive equations. We present the symmetric transformation: lambda-dropping. Lambda-dropping a set of recur-sive equations restores block structure and lexical scope. For lack of scope, recursive equations must carry around all the parameters that any of their callees might possibly need. Both lambda-lifting and lambda-dropping t...

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

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