نتایج جستجو برای: digital search tree

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

Journal: :Journal of Discrete Algorithms 2003

Alain Rouault, Brigitte Chauvin,

We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.

2009
Mario Döller Tobias René Mayer Kim Lim Fong Stefan Beck Harald Kosch David Coquil

This paper presents an extension to inViPla, a video search framework designed for operation on Personal Digital Assistants (PDA). The internal query system of the original framework has been replaced with a new query engine which generates multimedia queries using the MPEG Query Format (MPQF) standard to achieve platform independence. To formulate such queries the Mobile Multimedia Composer ha...

1994
Behnam Bani-Eqbal

Fractal coding of digital images ooers many promising qualities. However the coding process suuers from the long search time of the domain block pool. In this paper, we obtain mathematical results on the distance measure used in the search. Then we derive an incremental procedure to bound the domain block pixels. We arrange the domain blocks in a tree structure, and utilise the procedure to dir...

Journal: :EAI Endorsed Transactions on Internet of Things 2018

   Multiplier is one of the important components in many systems such as digital filters, digital processors and data encryption. Improving the speed and area of multipliers have impact on the performance of larger arithmetic circuits that are part of them. Wallace algorithm is one of the most famous architectures that uses a tree of half adders and full adders to increase the speed and red...

2009
Claus Vielhauer Maik Schott Jana Dittmann

Annotation watermarking is an application of watermarking where information about a cover or a part thereof are embedded in the cover itself to link both directly together. In earlier work we introduced Nested Object Annotation Watermarking as a special case, where the semantic, shape and hierarchical relations between the depicted nested objects are embedded in the area of each object only. As...

1994
Guy Louchard Wojciech Szpankowski

Consider the parsing algorithm due to Lempel and Ziv that partitions a sequence of length n into variable phrases (blocks) such that a new block is the shortest substring not seen in the past as a phrase. In practice the following parameters are of interest: number of phrases, the size of a phrase, the number of phrases of given size, and so forth. In this paper, we focus on the size of a rando...

2013
Briana Lowe Wellman Shameka Dawson Monica Anderson

In cooperative robot teams, communications can speed up execution, reduce duplication, and prevent interference. Although many systems use explicit communications, persistent intra-team digital communications is not guaranteed. One approach to this challenge is to use implicit communication to infer state rather than using digital messages. We investigate using implicit communication in the for...

Journal: :SIAM Journal on Computing 1986

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

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